Library Header Image
LSE Research Online LSE Library Services

Fixed-order scheduling on parallel machines

Bosman, Thomas, Frascaria, Dario, Olver, Neil ORCID: 0000-0001-8897-5459, Sitters, Rene and Stougie, Leen (2019) Fixed-order scheduling on parallel machines. In: Lodi, Andrea and Nagarajan, Viswanath, (eds.) Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),11480. Springer Berlin / Heidelberg, Cham, CHE, 88 - 100. ISBN 9783030179526

Full text not available from this repository.

Identification Number: 10.1007/978-3-030-17953-3_7


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

Item Type: Book Section
Official URL:
Additional Information: © 2019 Springer Nature Switzerland AG
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 23 Jan 2020 16:45
Last Modified: 16 May 2024 05:53

Actions (login required)

View Item View Item