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 in:	The 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
Language:	English
Published:	Taylor & Francis 03.10.2021
Subjects:	complexity dynamic programming fixed job sequence makespan Parallel machines single server
ISSN:	0160-5682, 1476-9360
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!