Skip to main content
SpringerLink
Log in

A General Variable Neighborhood Search Algorithm for the No-Idle Permutation Flowshop Scheduling Problem

  • Conference paper
Swarm, Evolutionary, and Memetic Computing (SEMCCO 2013)

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

Included in the following conference series:

Abstract

In this study, a general variable neighborhood search (GVNS) is presented to solve no-idle permutation flowshop scheduling problem (NIPFS), where idle times are not allowed on machines. GVNS is a metaheuristic, where inner loop operates a variable neighborhood descend (VND) algorithm whereas the outer loop carries out some perturbations on the current solution. We employ a simple insert and swap moves in the outer loop whereas iterated greedy (IG) and iterated local search (ILS) algorithms are employed in the VND as neighborhood structures. The results of the GVNS algorithm are compared to those generated by the variable iterated greedy algorithm with differential evolution (vIG_DE). The performance of the proposed algorithm is tested on the Ruben Ruiz’ benchmark suite that is presented in http://soa.iti.es/rruiz. Computational results showed that the GVNS algorithm further improved 85 out of 250 best solutions found so far in the literature.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adiri, I., Pohoryles, D.: Flow-shop/no-idle or no-wait scheduling to minimize the sum of completion times. Naval Research Logistics Quarterly 29(3), 495–504 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  2. Baptiste, P., Lee, K.H.: A branch and bound algorithm for the F|no-idle|Cmax. In: Lyon : Proceedings of the International Conference on Industrial Engineering and Production Management (IEPM), vol. 1, pp. 429–438 (1997)

    Google Scholar 

  3. Saadani, H., Guinet, A., Moalla, M.: Three stage no-idle flow-shops. Computers and Industrial Engineering 44, 425–434 (2003)

    Article  Google Scholar 

  4. Lourenc, H.R., Martin, O., Stützle, T.: Iterated local search. G. K. F. Glover içinde. In: Handbook of Metaheuristics, International Series in Operations Research & Management Science, Cilt 57, pp. s. 321–s. 353. Kluwer Academic Publishers, Norwell (2002)

    Google Scholar 

  5. Hansen, P., Mladenovic, N., Urosevic, D.: Variable neighborhood search and the local search and local branching. Computers & Operations Research 33(10), 3034–3045 (2006)

    Article  MATH  Google Scholar 

  6. Kalczynski, P.J., Kamburowski, J.: On no-wait and no-idle flow shops with makespan criterion. European Journal of Operational Research 178(3), 677–685 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kirlik, G., Oguz, C.: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine. Computers & Operations Research 39, 1506–1520 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  8. Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research 24, 1097–1100 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  9. Nawaz, M., Enscore Jr., E.E., Ham, I.: A heuristic algorithm for the m-machine, njob flow-shop sequencing problem. OMEGA, The International Journal of Management Science 11(1), 91–95 (1983)

    Article  Google Scholar 

  10. Pan, Q.-K., Wang, L.: A novel differential evolution algorithm for no-idle permutation flowshop scheduling problems. European Journal of Industrial Engineering 2(3), 279–297 (2008)

    Article  Google Scholar 

  11. Ruiz, R., Vallada, E., Fernández-Martínez, C.: Scheduling in Flowshops with No-Idle Machines. Computational Intelligence in Flow Shop and Job Shop Scheduling Studies in Computational Intelligence 230, 21–51 (2009)

    Article  Google Scholar 

  12. Tasgetiren, M.F., Pan, Q., Suganthan, P.N., Oner, A.: A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Applied Mathematical Modelling (2013)

    Google Scholar 

  13. Vachajitpan, P.: Job sequencing with continuous machine operation. Computers and Industrial Engineering 6(3), 255–259 (1982)

    Article  Google Scholar 

  14. Woollam, C.R.: Flowshop with no idle machine time allowed. Computers and Industrial Engineering 10(1), 69–76 (1986)

    Article  Google Scholar 

  15. Tasgetiren, M.F., Pan, Q., Suganthan, P.N., Buyukdagli, O.: A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem. Computers & Operations Research 40, 1729–1743 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Industrial Engineering Department, Yasar University, Izmir, Turkey

    M. Fatih Tasgetiren & Ozge Buyukdagli

  2. College of Computer Science, Liaocheng University, Liaocheng, Shandong, P.R. China

    Quan-Ke Pan

  3. School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore

    Ponnuthurai Nagaratnam Suganthan

Authors
  1. M. Fatih Tasgetiren
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ozge Buyukdagli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Quan-Ke Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ponnuthurai Nagaratnam Suganthan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Electrical Engineering Dept., IIT Delhi, Hauz Khas, 110016, New Delhi, India

    Bijaya Ketan Panigrahi

  2. School of Electrical and Electronic Engineering, Nanyang Technological University, 639798, Singapore

    Ponnuthurai Nagaratnam Suganthan

  3. Electronics and Communication Sciences Unit, Indian Statistical Institute, 700108, Kolkata, India

    Swagatam Das

  4. SRM Engineering College, Department of Electrical and Electronics Engineering, SRM University, Potheri, Kattankulathur, Kancheepuram, 603203, Tamil Nadu, India

    Shubhransu Sekhar Dash

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Tasgetiren, M.F., Buyukdagli, O., Pan, QK., Suganthan, P.N. (2013). A General Variable Neighborhood Search Algorithm for the No-Idle Permutation Flowshop Scheduling Problem. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Dash, S.S. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2013. Lecture Notes in Computer Science, vol 8297. Springer, Cham. https://doi.org/10.1007/978-3-319-03753-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03753-0_3

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03752-3

  • Online ISBN: 978-3-319-03753-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation