Abstract
This paper considers two semi-online versions of scheduling problem P2||Cmax where one type of partial information is available and one type of additional algorithmic extension is allowed simultaneously. For the semi-online version where a buffer of length 1 is available and the total size of all jobs is known in advance, we present an optimal algorithm with competitive ratio 5/4. We also show that it does not help that the buffer length is greater than 1. For the semi-online version where two parallel processors are available and the total size of all jobs is known in advance, we present an optimal algorithm with competitive ratio 6/5.
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
The second author is supported by TRAPOYT of China, National Natural Science Foundation of China (10271110). Corresponding author: Y. He.
Rights and permissions
About this article
Cite this article
Dósa, G., He, Y. Semi-Online Algorithms for Parallel Machine Scheduling Problems. Computing 72, 355–363 (2004). https://doi.org/10.1007/s00607-003-0034-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-003-0034-2