Abstract
In this paper, two tools to improve the performance of the NEH-based heuristics for the flow shop problem with and without buffer constraints are proposed. The first tool is the use of the reversibility property of the problems considered and the second one is a new tie-breaking strategy to be use in the insertion phase of the NEH heuristic. In addition, we have analyzed the behavior of five initial solution procedures for both problems. The analysis of results confirms the effectiveness of the measures proposed and allows us to recommend the best ordering procedure for each one of the problems.
Chapter PDF
Similar content being viewed by others
References
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. In: Annals of Discrete Mathematics, pp. 5287–5326 (1979)
Johnson, S.M.: Optimal two- and three-stage production schedules with set up times included. Naval Research Logistics Quarterly 1, 61–68 (1954)
Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-Completness. Freeman, San Francisco (1979)
Nawaz, M., Enscore Jr., E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11, 91–95 (1983)
Nagano, M.S., Moccellin, J.V.: A high quality constructive heuristic for flow shop sequencing. Journal of the Operational Research Society 53, 1374–1379 (2002)
Framinan, J.M., Leisten, R., Ramamoorthy, B.: Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. International Journal of Production Research 41, 121–148 (2003)
Companys, R.: Métodos heurísticos en la resolución del problema del taller mecánico. Estudios Empresariales 5, 7–18 (1966)
Pour, H.D.: A new heuristic for the n-job, m-machine flow shop problem. Production Planning & Control 12, 648–653 (2001)
Reddi, S.S., Ramamoorthy, B.: On the flow-shop sequencing problem with no wait in process. Opers Res. Q. 23, 323–331 (1972)
Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no wait in process. Operations Research 44, 510–525 (1996)
Papadimitriou, C.H., Kanellakis, P.C.: Flowshop scheduling with limited temporary storage. Journal of the ACM 27, 533–549 (1980)
Leisten, R.: Flowshop sequencing problems with limited buffer storage. Int. J. Prod. Res. 28, 2085–2100 (1990)
McCormick, S.T., Pinedo, M.L., Shenker, S., Wolf, B.: Sequencing in an Assembly Line with Blocking to Minimize Cycle Time. Operations Research 37, 925–936 (1989)
Kalczynski, P.J., Kamburowski, J.: An improved NEH heuristic to minimize makespan in permutation flow shops. Computers & Operations Research 9, 3001–3008 (2008)
Companys, R., Mateo, M.: Different behaviour of a double branch-and-bound algorithm on Fm|prmu|Cmax and Fm|block|Cmax problems. Computers & Operations Research 34, 938–953 (2007)
Companys, R.: Note on the blocking flowshop problem. Working paper (2009), http://upcommons.upc.edu/e-prints/handle/2117/420
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP International Federation for Information Processing
About this paper
Cite this paper
Ribas, I., Mateo, M. (2010). Improvement Tools for NEH Based Heuristics on Permutation and Blocking Flow Shop Scheduling Problems. In: Vallespir, B., Alix, T. (eds) Advances in Production Management Systems. New Challenges, New Approaches. APMS 2009. IFIP Advances in Information and Communication Technology, vol 338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16358-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-16358-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16357-9
Online ISBN: 978-3-642-16358-6
eBook Packages: Computer ScienceComputer Science (R0)