Abstract
This paper considers semi-online scheduling problems on parallel identical machines with combined partial information. For the objective to minimize makespan, and both the largest processing time of all jobs and the total processing time of all jobs are known in advance, we present an optimal algorithm with competitive ratio 4/3 on three machines. For the objective to maximize the minimum machine load, and both the largest processing time of all jobs and the optimal value are known in advance, we present algorithms which are optimal when the machine number is less than 5.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Azar, Y., Epstein, L.: On-line machine covering. Journal of Scheduling 1, 67–77 (1998)
Azar, Y., Regev, O.: On-line bin-stretching. Theoretical Computer Science 168, 17–41 (2001)
Chang, S.Y., Hwang, H.C., Park, J.: Semi-on-line parallel machines scheduling under known total and largest processing times. Journal of the Operations Research Society of Japan 48, 1–8 (2005)
Cheng, T.C.E., Kellerer, H., Kotov, V.: Semi-on-line multiprocessor scheduling with given total processing time. Theoretical Computer Science 337, 134–146 (2005)
Ebenlendr, T., Noga, J., Sgall, J., Woeginger, G.: A note on semi-online machine covering. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 110–118. Springer, Heidelberg (2006)
He, Y.: Semi on-line scheduling problem for maximizing the minimum machine completion time. Acta Mathematica Applicatae Sinica 17, 107–113 (2001)
He, Y., Zhang, G.C.: Semi on-line scheduling on two identical machines. Computing 62, 179–187 (1999)
Kellerer, H., Kotov, V., Speranza, M.R., Tuza, Z.: Semi on-line algorithms for the partition problem. Operations Research Letters 21, 235–242 (1997)
Tan, Z.Y., He, Y.: Semi-on-line problems on two identical machines with combined partial information. Operations Research Letters 30, 408–414 (2002)
Tan, Z.Y., Wu, Y.: Optimal semi-online algorithms for machine covering. Theoretical Computer Science 372, 69–80 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, Y., Tan, Z., Yang, Q. (2007). Optimal Semi-online Scheduling Algorithms on a Small Number of Machines. In: Chen, B., Paterson, M., Zhang, G. (eds) Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. ESCAPE 2007. Lecture Notes in Computer Science, vol 4614. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74450-4_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-74450-4_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74449-8
Online ISBN: 978-3-540-74450-4
eBook Packages: Computer ScienceComputer Science (R0)