Fixed-Order Scheduling on Parallel Machines - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Fixed-Order Scheduling on Parallel Machines


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.
Fichier principal
Vignette du fichier
ZBScheduling_.pdf (317.27 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02336592 , version 1 (29-10-2019)



Thomas Bosman, Dario Frascaria, Neil Olver, Rene Sitters, Leen Stougie. Fixed-Order Scheduling on Parallel Machines. Integer Programming and Combinatorial Optimization (IPCO), 2019, Ann Arbor, United States. pp.88-100, ⟨10.1007/978-3-030-17953-3_7⟩. ⟨hal-02336592⟩
78 View
176 Download



Gmail Facebook X LinkedIn More