Fixed-Order Scheduling on Parallel Machines

Thomas Bosman*, Dario Frascaria, Neil Olver, René Sitters, Leen Stougie

*Corresponding author for this work

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

We consider the following natural scheduling problem: Given a sequence of jobs with weights and processing times, one needs to assign each job to one of m identical machines in order to minimize the sum of weighted completion times. The twist is that for machine the jobs assigned to it must obey the order of the input sequence, as is the case in multi-server queuing systems. We establish a constant factor approximation algorithm for this (strongly NP-hard) problem. Our approach is necessarily very different from what has been used for similar scheduling problems without the fixed-order assumption. We also give a QPTAS for the special case of unit processing times.

Original languageEnglish
Title of host publicationInteger Programming and Combinatorial Optimization
Subtitle of host publication20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22–24, 2019, Proceedings
EditorsViswanath Nagarajan, Andrea Lodi
PublisherSpringer Verlag
Pages88-100
Number of pages13
ISBN (Electronic)9783030179533
ISBN (Print)9783030179526
DOIs
Publication statusPublished - 2019
Event20th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2019 - Ann Arbor, United States
Duration: 22 May 201924 May 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11480
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2019
CountryUnited States
CityAnn Arbor
Period22/05/1924/05/19

Fingerprint Dive into the research topics of 'Fixed-Order Scheduling on Parallel Machines'. Together they form a unique fingerprint.

Cite this