An Iterated Local Search Algorithm for the Two-Machine Flow Shop Problem with Buffers and Constant Processing Times on One Machine

  • Hoang Thanh LeEmail author
  • Philine Geser
  • Martin Middendorf
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11452)


This paper considers a special case of two-machine flow shop scheduling problems with buffers, namely, the case where all processing times on one of the two machines are equal. This case is interesting because it occurs in various applications, e.g., when one machine is a packing machine. For the buffers we consider two types of buffers that have been studied in the literature for flow shops. It is shown that all considered buffered flow shop problems remain NP-hard for the makespan criterion and permutation schedules even with the restriction to equal processing times on one machine. Two specific heuristics for solving the problems are proposed: (i) a modification of the commonly used NEH heuristic (mNEH) and (ii) an Iterated Local Search heuristic (2BF-ILS) that uses the mNEH heuristic for computing its initial solution. It is shown experimentally that the proposed 2BF-ILS heuristic obtains better results than two state-of-the-art algorithms for buffered flow shop problems from the literature and an Ant Colony Optimization algorithm. In addition, it is shown experimentally that 2BF-ILS can obtain the same solution quality as the standard NEH heuristic with a smaller number of function evaluations.


Flow shops with buffers Iterated Local Search NEH heuristic Permutation schedules 



This work was funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - project number 392050753.


  1. 1.
    Abdollahpour, S., Rezaeian, J.: Minimizing makespan for flow shop scheduling problem with intermediate buffers by using hybrid approach of artificial immune system. Appl. Soft Comput. 28(C), 44–56 (2015)CrossRefGoogle Scholar
  2. 2.
    Aloulou, M.A., Bouzaiene, A., Dridi, N., Vanderpooten, D.: A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size. J. Sched. 17(1), 17–29 (2014)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Brucker, P., Heitmann, S., Hurink, J.: Flow-shop problems with intermediate buffers. Oper. Res. Spektrum 25(4), 549–574 (2003)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Carlier, J.: Ordonnancements a contraintes disjonctives. R.A.I.R.O. Recherche operationelle 12, 333–351 (1978)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Fernandez-Viagas, V., Framinan, J.M.: NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness. Comput. Oper. Res. 60, 27–36 (2015)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Fung, J., Zinder, Y.: Permutation schedules for a two-machine flow shop with storage. Oper. Res. Lett. 44(2), 153–157 (2016)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Geser, P.: Zur Komplexität des 2-Maschinen-Flow-Shop-Problems mit Zwischenspeicher. Diploma thesis, Leipzig University (2017)Google Scholar
  8. 8.
    Hsieh, Y.C., You, P.S., Liou, C.D.: A note of using effective immune based approach for the flow shop scheduling with buffers. Appl. Math. Comput. 215(5), 1984–1989 (2009)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist. Q. 1(1), 61–68 (1954)CrossRefGoogle Scholar
  10. 10.
    Kononova, P.A., Kochetov, Y.A.: The variable neighborhood search for the two machine flow shop problem with a passive prefetch. J. Appl. Ind. Math. 7(1), 54–67 (2013)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Li, S., Tang, L.: A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage. J. Intell. Manuf. 16(4), 463–477 (2005)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Lin, F.C., Hong, J.S., Lin, B.M.T.: A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations. Comput. Oper. Res. 36(4), 1158–1175 (2009)CrossRefGoogle Scholar
  13. 13.
    Liu, B., Wang, L., Jin, Y.H.: An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers. Comput. Oper. Res. 35(9), 2791–2806 (2008)CrossRefGoogle Scholar
  14. 14.
    Liu, S.Q., Kozan, E.: Scheduling a flow-shop with combined buffer conditions. Int. J. Prod. Econ. 117(2), 371–380 (2009)CrossRefGoogle Scholar
  15. 15.
    Liu, W., Jin, Y., Price, M.: A new improved NEH heuristic for permutation flowshop scheduling problems. Int. J. Prod. Econ. 193, 21–30 (2017)CrossRefGoogle Scholar
  16. 16.
    López-Ibáñez, M., Dubois-Lacoste, J., Pérez Cáceres, L., Stützle, T., Birattari, M.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43–58 (2016)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Martinez, S., Dauzère-Pérès, S., Guéret, C., Mati, Y., Sauer, N.: Complexity of flowshop scheduling problems with a new blocking constraint. Eur. J. Oper. Res. 169, 855–864 (2006)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Moslehi, G., Khorasanian, D.: A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion. Comput. Oper. Res. 52, 260–268 (2014)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11, 91–95 (1983)CrossRefGoogle Scholar
  20. 20.
    Pan, Q.K., Wang, L., Gao, L.: A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers. Appl. Soft Comput. 11, 5270–5280 (2011)CrossRefGoogle Scholar
  21. 21.
    Pan, Q.K., Wang, L., Gao, L., Li, W.D.: An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers. Inf. Sci. 181(3), 668–685 (2011)CrossRefGoogle Scholar
  22. 22.
    Papadimitriou, C.H., Kanellakis, P.C.: Flowshop scheduling with limited temporary storage. J. Assoc. Comput. Mach. (JACM) 27(3), 533–549 (1980)MathSciNetCrossRefGoogle Scholar
  23. 23.
    Reeves, C.: A genetic algorithm for flowshop sequencing. Comput. Oper. Res. 22(1), 5–13 (1995)CrossRefGoogle Scholar
  24. 24.
    Sang, H.Y., Pan, Q.K.: An effective invasive weed optimization algorithm for the flow shop scheduling with intermediate buffers. In: 25th Chinese Control and Decision Conference (CCDC), pp. 861–864 (2013)Google Scholar
  25. 25.
    Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64, 278–285 (1993)CrossRefGoogle Scholar
  26. 26.
    Vallada, E., Ruiz, R., Framinan, J.M.: New hard benchmark for flowshop scheduling problems minimising makespan. Eur. J. Oper. Res. 240, 666–677 (2015)CrossRefGoogle Scholar
  27. 27.
    Vázquez-Rodríguez, J.A., Ochoa, G.: On the automatic discovery of variants of the neh procedure for flow shop scheduling using genetic programming. J. Oper. Res. Soc. 62(2), 381–396 (2011)CrossRefGoogle Scholar
  28. 28.
    Wang, L., Zhang, L., Zheng, D.Z.: An effective hybrid genetic algorithm for flow shop scheduling with limited buffers. Comput. Oper. Res. 33, 2960–2971 (2006)MathSciNetCrossRefGoogle Scholar
  29. 29.
    Weise, T., Chiong, R., Lassig, J., Tang, K., Tsutsui, S., Chen, W., Michalewicz, Z., Yao, X.: Benchmarking optimization algorithms: an open source framework for the traveling salesman problem. IEEE Comput. Intell. Mag. 9(3), 40–52 (2014)CrossRefGoogle Scholar
  30. 30.
    Zhang, S.J., Gu, X.S.: An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers. J. Central South Univ. 22(9), 3471–3484 (2015)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Swarm Intelligence and Complex Systems Group, Institute of Computer ScienceUniversity of LeipzigLeipzigGermany

Personalised recommendations