Abstract
In this paper we investigate the following scheduling problem: We have two sets of identical machines, the jobs have two processing times one for each set of machines. We consider two different objective functions, in the first model the goal is to minimize the maximum of the makespans on the sets, in the second model we minimize the sum of the makespans. We consider the online, semi online and offline versions of these problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
This research has been partially supported by the Future and Emerging Technologies programme of the EU under contract number IST-1999-14186 (ALCOM-FT) and by the Hungarian National Foundation for Scientific Research, Grant TO30074. During some part of this work the author had a postdoctoral scholarship at MPI Informatics in Saarbrücken.
Rights and permissions
About this article
Cite this article
Imreh, C. Scheduling Problems on Two Sets of Identical Machines. Computing 70, 277–294 (2003). https://doi.org/10.1007/s00607-003-0011-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-003-0011-9