Advertisement

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

  • M. Fatih Tasgetiren
  • Ozge Buyukdagli
  • Quan-Ke Pan
  • Ponnuthurai Nagaratnam Suganthan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8297)

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.

Keywords

no-idle permutation flowshop scheduling problem general variable neighborhood search heuristic optimization metaheuristics 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 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. 3.
    Saadani, H., Guinet, A., Moalla, M.: Three stage no-idle flow-shops. Computers and Industrial Engineering 44, 425–434 (2003)CrossRefGoogle Scholar
  4. 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. 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)CrossRefzbMATHGoogle Scholar
  6. 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)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 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)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research 24, 1097–1100 (1997)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 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)CrossRefGoogle Scholar
  10. 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)CrossRefGoogle Scholar
  11. 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)CrossRefGoogle Scholar
  12. 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. 13.
    Vachajitpan, P.: Job sequencing with continuous machine operation. Computers and Industrial Engineering 6(3), 255–259 (1982)CrossRefGoogle Scholar
  14. 14.
    Woollam, C.R.: Flowshop with no idle machine time allowed. Computers and Industrial Engineering 10(1), 69–76 (1986)CrossRefGoogle Scholar
  15. 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)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • M. Fatih Tasgetiren
    • 1
  • Ozge Buyukdagli
    • 1
  • Quan-Ke Pan
    • 2
  • Ponnuthurai Nagaratnam Suganthan
    • 3
  1. 1.Industrial Engineering DepartmentYasar UniversityIzmirTurkey
  2. 2.College of Computer ScienceLiaocheng UniversityLiaochengP.R. China
  3. 3.School of Electrical and Electronic EngineeringNanyang Technological UniversitySingapore

Personalised recommendations