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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:The Journal of the Operational Research Society Ročník 72; číslo 10; s. 2286 - 2289
Hlavní autoři: Cheng, T. C. E., Kravchenko, Svetlana A., Lin, Bertrand M. T.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Taylor & Francis 03.10.2021
Témata:
complexity
dynamic programming
fixed job sequence
makespan
Parallel machines
single server
ISSN:0160-5682, 1476-9360
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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