Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Evolutionary Computation in Combinatorial Optimization (EvoCOP 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11452))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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)

    Article  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  3. Brucker, P., Heitmann, S., Hurink, J.: Flow-shop problems with intermediate buffers. Oper. Res. Spektrum 25(4), 549–574 (2003)

    Article  MathSciNet  Google Scholar 

  4. Carlier, J.: Ordonnancements a contraintes disjonctives. R.A.I.R.O. Recherche operationelle 12, 333–351 (1978)

    MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  6. Fung, J., Zinder, Y.: Permutation schedules for a two-machine flow shop with storage. Oper. Res. Lett. 44(2), 153–157 (2016)

    Article  MathSciNet  Google Scholar 

  7. Geser, P.: Zur Komplexität des 2-Maschinen-Flow-Shop-Problems mit Zwischenspeicher. Diploma thesis, Leipzig University (2017)

    Google Scholar 

  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)

    MathSciNet  MATH  Google Scholar 

  9. Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist. Q. 1(1), 61–68 (1954)

    Article  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  14. Liu, S.Q., Kozan, E.: Scheduling a flow-shop with combined buffer conditions. Int. J. Prod. Econ. 117(2), 371–380 (2009)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  22. Papadimitriou, C.H., Kanellakis, P.C.: Flowshop scheduling with limited temporary storage. J. Assoc. Comput. Mach. (JACM) 27(3), 533–549 (1980)

    Article  MathSciNet  Google Scholar 

  23. Reeves, C.: A genetic algorithm for flowshop sequencing. Comput. Oper. Res. 22(1), 5–13 (1995)

    Article  Google Scholar 

  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. Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64, 278–285 (1993)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

Download references

Acknowledgements

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

Author information

Authors and Affiliations

  1. Swarm Intelligence and Complex Systems Group, Institute of Computer Science, University of Leipzig, Leipzig, Germany

    Hoang Thanh Le, Philine Geser & Martin Middendorf

Authors
  1. Hoang Thanh Le
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philine Geser
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martin Middendorf
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hoang Thanh Le .

Editor information

Editors and Affiliations

  1. University of Lille, Lille, France

    Arnaud Liefooghe

  2. University of Coimbra, Coimbra, Portugal

    Luís Paquete

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Le, H.T., Geser, P., Middendorf, M. (2019). An Iterated Local Search Algorithm for the Two-Machine Flow Shop Problem with Buffers and Constant Processing Times on One Machine. In: Liefooghe, A., Paquete, L. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2019. Lecture Notes in Computer Science(), vol 11452. Springer, Cham. https://doi.org/10.1007/978-3-030-16711-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-16711-0_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-16710-3

  • Online ISBN: 978-3-030-16711-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation