Abstract
NEH (Nawaz et al., 1983) is an effective heuristic for solving the permutation flowshop problem with the objective of makespan. It includes two phases. PE-VM (Li et al., 2004), which is based on NEH, is analyzed and we conclude that its good performance is partially due to the priority rule it used in phase I. Then, we propose a new measure to solve job insertion ties which may arise in phase II. The measure is based on the idea of balancing the utilization among all machines. Finally, we propose a heuristic NEH-D (NEH based on Deviation), which combines the priority rule of PE-VM and the new measure. Computational results show that the measure is effective and NEH-D is better than PE-VM. There is one parameter in NEH-D, and we design an experiment to try to find a near optimized value of it for tuning the performance of NEH-D.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Palmer, D.S.: Sequencing jobs through a multistage process in the minimum total time: a quick method of obtaining a near-optimum. Operational Research Quarterly 16, 101–107 (1965)
Campbell, H.G., Dudek, R.A., Smith, M.L.: A heuristic algorithm for the n job, m machine sequencing problem. Management Science 16, 630–637 (1970)
Gupta, J.N.D.: Heuristic algorithms for multistage flowshop scheduling problem. AIIE, Transactions 4, 11–18 (1972)
Dannenbring, D.G.: An evaluation of flowshop sequence heuristics. Management Science 23, 1174–1182 (1977)
Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA 11, 91–95 (1983)
Koulamas, C.: A new constructive heuristic for the flowshop scheduling problem. European Journal of Operational Research 105, 66–71 (1998)
Li, X.P., Wang, Y.X., Wu, C.: Heuristic algorithms for large flowshop scheduling problems. In: Proceedings of the 5th world congress on intelligent control and automation, Hangzhou, China, pp. 2999–3003 (2004)
Woo, H.S., Yim, D.S.: A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers & Operations Research 25(3), 175–182 (1998)
Framinan, J.M., Leisten, R., Ruiz-Usano, R.: Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation. European Journal of Operational Research 141, 559–569 (2002)
Framinan, J.M., Leisten, R.: An efficient constructive heuristic for flowtime minimisation in permutation flow shops. OMEGA 31, 311–317 (2003)
Taillard, E.: Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47, 65–74 (1990)
Pinedo, M.: Scheduling: theory, algorithms, and systems, 2nd edn. Prentice Hall, Englewood Cliffs (2001)
Johnson, S.M.: Optimal two and three-stage production schedule with setup times included. Naval Research Logistics Quarterly 1(1), 61–68 (1954)
Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dong, X., Huang, H., Chen, P. (2006). A More Effective Constructive Algorithm for Permutation Flowshop Problem. In: Corchado, E., Yin, H., Botti, V., Fyfe, C. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2006. IDEAL 2006. Lecture Notes in Computer Science, vol 4224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11875581_3
Download citation
DOI: https://doi.org/10.1007/11875581_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45485-4
Online ISBN: 978-3-540-45487-8
eBook Packages: Computer ScienceComputer Science (R0)