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

Podrobná bibliografia

Vydané v:	The Journal of the Operational Research Society Ročník 72; číslo 10; s. 2286 - 2289
Hlavní autori:	Cheng, T. C. E., Kravchenko, Svetlana A., Lin, Bertrand M. T.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Taylor & Francis 03.10.2021
Predmet:	complexity dynamic programming fixed job sequence makespan Parallel machines single server
ISSN:	0160-5682, 1476-9360
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!