Improvement Tools for NEH Based Heuristics on Permutation and Blocking Flow Shop Scheduling Problems

  • Imma Ribas
  • Manel Mateo
Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT, volume 338)


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.


Scheduling heuristic algorithms permutation flow shop blocking flow shop 


  1. 1.
    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)Google Scholar
  2. 2.
    Johnson, S.M.: Optimal two- and three-stage production schedules with set up times included. Naval Research Logistics Quarterly 1, 61–68 (1954)CrossRefGoogle Scholar
  3. 3.
    Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-Completness. Freeman, San Francisco (1979)Google Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    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)zbMATHCrossRefGoogle Scholar
  6. 6.
    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)zbMATHCrossRefGoogle Scholar
  7. 7.
    Companys, R.: Métodos heurísticos en la resolución del problema del taller mecánico. Estudios Empresariales 5, 7–18 (1966)Google Scholar
  8. 8.
    Pour, H.D.: A new heuristic for the n-job, m-machine flow shop problem. Production Planning & Control 12, 648–653 (2001)CrossRefGoogle Scholar
  9. 9.
    Reddi, S.S., Ramamoorthy, B.: On the flow-shop sequencing problem with no wait in process. Opers Res. Q. 23, 323–331 (1972)zbMATHCrossRefGoogle Scholar
  10. 10.
    Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no wait in process. Operations Research 44, 510–525 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Papadimitriou, C.H., Kanellakis, P.C.: Flowshop scheduling with limited temporary storage. Journal of the ACM 27, 533–549 (1980)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Leisten, R.: Flowshop sequencing problems with limited buffer storage. Int. J. Prod. Res. 28, 2085–2100 (1990)zbMATHCrossRefGoogle Scholar
  13. 13.
    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)zbMATHCrossRefGoogle Scholar
  14. 14.
    Kalczynski, P.J., Kamburowski, J.: An improved NEH heuristic to minimize makespan in permutation flow shops. Computers & Operations Research 9, 3001–3008 (2008)CrossRefMathSciNetGoogle Scholar
  15. 15.
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Companys, R.: Note on the blocking flowshop problem. Working paper (2009),

Copyright information

© IFIP International Federation for Information Processing 2010

Authors and Affiliations

  • Imma Ribas
    • 1
  • Manel Mateo
    • 1
  1. 1.Dpto. de Organización de Empresas, Escuela Técnica Superior de Ingeniería Industrial de BarcelonaUniversidad Politécnica de CataluñaBarcelona

Personalised recommendations