Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences

We study server scheduling on parallel dedicated machines to minimize the makespan subject to given processing sequences. Before a job starts its processing on its designated machine, a loading operation must be performed, which is undertaken by a server shared by all the jobs. While the two-machine...

Full description

Saved in:
Bibliographic Details
Published inThe Journal of the Operational Research Society Vol. 72; no. 10; pp. 2286 - 2289
Main Authors Cheng, T. C. E., Kravchenko, Svetlana A., Lin, Bertrand M. T.
Format Journal Article
LanguageEnglish
Published Taylor & Francis 03.10.2021
Subjects
complexity
dynamic programming
fixed job sequence
makespan
Parallel machines
single server
Online AccessGet full text

Cover

More Information
Summary:We study server scheduling on parallel dedicated machines to minimize the makespan subject to given processing sequences. Before a job starts its processing on its designated machine, a loading operation must be performed, which is undertaken by a server shared by all the jobs. While the two-machine problem is polynomially solvable, we show that the problem becomes binary NP-hard when the number of machines is three, and propose a pseudo-polynomial algorithm to solve the problem with a constant number of machines.
ISSN:0160-5682
1476-9360
DOI:10.1080/01605682.2020.1779625