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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Journal of the Operational Research Society Jg. 72; H. 10; S. 2286 - 2289
Hauptverfasser: Cheng, T. C. E., Kravchenko, Svetlana A., Lin, Bertrand M. T.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Taylor & Francis 03.10.2021
Schlagworte:
complexity
dynamic programming
fixed job sequence
makespan
Parallel machines
single server
ISSN:0160-5682, 1476-9360
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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