Abstract
For the parallel machine scheduling problem under consideration, the authors in two literatures of 1961 and 2002 respectively gave the proofs for the optimal makespan under Level Algorithm. But, some errors in their proofs are found by us with three counterexamples, and no one has given the correct proof until now. In this paper, a new algorithm is proposed. And the new algorithm is more convenient and easier for theoretical analysis than Level Algorithm does. Then, it is showed that the result schedule obtained by using the new algorithm is consistent with that by Level Algorithm in the sense that they can give the same result schedule. Finally, by using the proposed new algorithm, the proof for the optimal makespan is accomplished.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Blazewicz, J., et al.: Scheduling in Computer and Manufacturing Systems, p. 124. Springer, Berlin (1993)
Brucker, P., Garey, M.R., Johnson, D.S.: Scheduling Equal-Length Tasks under Treelike Precedence Constraints to Minimize Maximum Lateness. Mathematics of Operations Research 2(3), 275–284 (1977)
Hu, T.C.: Parallel Sequencing and Assembly Line Problems. Operations Research 9, 841–848 (1961)
Leung, J.Y.-T.: Handbooks of Scheduling∙Algorithms, Models, and Performance Analysis, pp. 3-1–3-4. CRC Press, Boca Raton (2004)
Monma, C.L.: Linear-Time Algorithms for Scheduling on Parallel Processors. Operations Research 30, 116–124 (1982)
Tanaev, V.S., Gordon, V.S., Shafransky, Y.M.: Scheduling Theory∙Single-Stage Systems, pp. 122–126. Kluwer Academic Publishers, Dordrecht (1994)
Tang, H.Y., Zhao, C.L.: Introduction to scheduling, pp. 49–52. Science Press, Beijing (2002)
Yue, M.Y.: Introduction to Combinatorial Optimization, pp. 70–72. Zhejiang Science and Technology Press, Zhejiang (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Y., Gu, Y., Sun, K., Li, H. (2007). A Note on the Optimal Makespan of a Parallel Machine Scheduling Problem. In: Cao, BY. (eds) Fuzzy Information and Engineering. Advances in Soft Computing, vol 40. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71441-5_53
Download citation
DOI: https://doi.org/10.1007/978-3-540-71441-5_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71440-8
Online ISBN: 978-3-540-71441-5
eBook Packages: EngineeringEngineering (R0)