Skip to main content
SpringerLink
Log in

Iterated Local Search Algorithms for the Sequence-Dependent Setup Times Flow Shop Scheduling Problem Minimizing Makespan

  • Conference paper
  • First Online:
Foundations of Intelligent Systems

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 277))

Abstract

Iterated Local Search (ILS) algorithm is a simple and effective metaheuristic for permutation flow shop scheduling problem (PFSP) minimizing the total flow time. In this work, the ILS algorithms are studied to deal with the PFSP with sequence-dependent setup times (SDST-PFSP) minimizing makespan. The first two methods, originally proposed for the PFSP minimizing total flow time, are adapted for the discussed problem. Four other ILS versions are also designed using different perturbation methods. Experimental results on a benchmark set show that the proposed ILSs can solve the discussed problem more effectively, and much better than the iterated greedy algorithm, one of the existing state-of-the-art algorithms. This work shows that the ILS is a promising method for extended types of scheduling problems.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Johnson SM (1954) Optimal two and three-stage production schedules with setup times included. Naval Res Logistics Q 1:61–68

    Article  Google Scholar 

  2. Pinedo M (2001) Scheduling: theory, algorithms, and systems, 2nd edn. Prentice Hall, Englewood Cliffs

    Google Scholar 

  3. Gupta JND (1986) Flowshop schedules with sequence dependent setup times. J Oper Res Soc Jpn 29:206–219

    MATH  Google Scholar 

  4. Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup considerations. Omega 27:219–239

    Article  Google Scholar 

  5. Ruiz R, Maroto C, Alcaraz J (2005) Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. Eur J Oper Res 165:34–54

    Article  MATH  MathSciNet  Google Scholar 

  6. Ruiz R, Stützle T (2008) An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur J Oper Res 187:1143–1159

    Article  MATH  Google Scholar 

  7. Rajendran C, Ziegler H (2004) Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. Eur J Oper Res 155:426–438

    Article  MATH  MathSciNet  Google Scholar 

  8. Ruiz R, Stützle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177:2033–2049

    Article  MATH  Google Scholar 

  9. Lourenço H, Martin O, Stützle T (2010) Iterated local search: framework and applications. Handbook of metaheuristics, vol 146. International series in operations research and management science. Springer, US, pp 363–397

    Google Scholar 

  10. Stützle T (1998) Applying iterated local search to the permutation flow shop problem. FG Intellektik, TU Darmstadt, Darmstadt

    Google Scholar 

  11. Dong X, Huang H, Chen P (2009) An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion. Comput Oper Res 36:1664–1669

    Article  MATH  MathSciNet  Google Scholar 

  12. Dong X, Chen P, Huang H, Nowak M (2013) A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time. Comput Oper Res 40:627–632

    Article  Google Scholar 

  13. Pan QK, Ruiz R (2012) Local search methods for the flowshop scheduling problem with flowtime minimization. Eur J Oper Res 222:31–43

    Article  MATH  MathSciNet  Google Scholar 

  14. Riós-Mercado RZ, Bard JF (1998) Heuristics for the flow line problem with setup costs. Eur J Oper Res 110:76–98

    Article  MATH  Google Scholar 

  15. Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. Omega 11:91–95

    Article  Google Scholar 

  16. Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47:65–74

    Article  MATH  MathSciNet  Google Scholar 

  17. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278–285

    Article  MATH  Google Scholar 

Download references

Acknowledgments

This work is supported by The Fundamental Research Funds for the Central Universities of China (Project Ref. 2014JBM034, Beijing Jiaotong University).

Author information

Authors and Affiliations

  1. Beijing Key Lab of Traffic Data Analysis and Mining, School of Computer and IT, Beijing Jiaotong University, Beijing, 100044, China

    Yanqi Wang, Xingye Dong & Youfang Lin

  2. TEDA College, NanKai University, Tianjin, 300457, China

    Ping Chen

Authors
  1. Yanqi Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xingye Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ping Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Youfang Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xingye Dong .

Editor information

Editors and Affiliations

  1. College of Computer and Software Engineering, Shenzhen University, Shenzhen, China

    Zhenkun Wen

  2. School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China

    Tianrui Li

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Y., Dong, X., Chen, P., Lin, Y. (2014). Iterated Local Search Algorithms for the Sequence-Dependent Setup Times Flow Shop Scheduling Problem Minimizing Makespan. In: Wen, Z., Li, T. (eds) Foundations of Intelligent Systems. Advances in Intelligent Systems and Computing, vol 277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54924-3_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54924-3_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54923-6

  • Online ISBN: 978-3-642-54924-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation