Skip to main content

A Variable Iterated Greedy Algorithm with Differential Evolution for Solving No-Idle Flowshops

  • Conference paper

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

Abstract

In this paper, we present a variable iterated greedy algorithm where its parameters (basically destruction size and probability of whether or not to apply the iterated greedy algorithm to an individual) are optimized by the differential evolution algorithm. A unique multi-chromosome solution representation is presented in such a way that the first chromosome represents the destruction size and the probability whereas the second chromosome is simply a job permutation assigned to each individual in the population randomly. The proposed algorithm is applied to the no-idle permutation flowshop scheduling problem with the makespan criterion. The performance of the proposed algorithm is tested on the Ruben Ruiz’s benchmark suite and compared to their best known solutions available in http://soa.iti.es/rruiz as well as to a very recent discrete differential evolution algorithm from the literature. The computational results show its highly competitive performance and ultimately, 183 out of 250 instances are further improved. In comparison to the very recent hybrid discrete differential evolution algorithm, 114 out of 150 new best known solutions they provided are also further improved.

Keywords

  • Differential evolution algorithm
  • iterated greedy algorithm
  • no-idle permutation flowshop scheduling problem
  • heuristic optimization

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    CrossRef  Google Scholar 

  2. Tanaev, V.S., Sotskov, Y.N., Strusevich, V.A.: Scheduling Theory. Multi-Stage Systems. Kluwer Academic Publishers, Dordrecht (1994)

    CrossRef  MATH  Google Scholar 

  3. Baptiste, P., Hguny, L.K.: A branch and bound algorithm for the F/no−idle/Cmax. In: Proceedings of the International Conference on Industrial Engineering and Production Management, IEPM 1997, Lyon, France, pp. 429–438 (1997)

    Google Scholar 

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

    CrossRef  Google Scholar 

  5. Baraz, D., Mosheiov, G.: A note on a greedy heuristic for the flow-shop makespan minimization with no machine idle-time. European Journal of Operational Research 184(2), 810–813 (2008)

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. 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)

    CrossRef  MathSciNet  MATH  Google Scholar 

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

    CrossRef  Google Scholar 

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

    CrossRef  Google Scholar 

  9. Cepek, O., Okada, M., Vlach, M.: Note: On the two-machine no-idle flowshop problem. Naval Research Logistics 47(4), 353–358 (2000)

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Narain, L., Bagga, P.C.: Flowshop/no-idle scheduling to minimise the mean flowtime. Anziam Journal 47, 265–275 (2005)

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. Saadani, N.E.H., Guinet, A., Moalla, M.: A traveling salesman approach to solve the F/no − idle/Cmax problem. In: Proceedings of the International Conference on Industrial Engineering and Production Management (IEPM 2001), Quebec, Canada, pp. 880–888 (2001)

    Google Scholar 

  12. Saadani, N.E.H., Guinet, A., Moalla, M.: A travelling salesman approach to solve the F/no−idle/Cmax problem. European Journal of Operational Research 161(1), 11–20 (2005)

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. Kamburowski, J.: More on three-machine no-idle flow shops. Computers and Industrial Engineering 46(3), 461–466 (2004)

    CrossRef  Google Scholar 

  14. Narain, L., Bagga, P.C.: Flowshop/no-idle scheduling to minimize total elapsed time. Journal of Global Optimization 33(3), 349–367 (2005)

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. 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)

    CrossRef  MathSciNet  MATH  Google Scholar 

  16. 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)

    CrossRef  Google Scholar 

  17. Pan, Q.-K., Wang, L.: No-idle permutation flow shop scheduling based on a hybrid discrete particle swarm optimization algorithm. International Journal of Advanced Manufacturing Technology 39(7-8), 796–807 (2008)

    CrossRef  Google Scholar 

  18. Ruiz, R., Vallada, E., Fernández-Martínez, C.: Scheduling in Flowshops with No-Idle Machines. In: Chakraborty, U.K. (ed.) Computational Intelligence in Flow Shop and Job Shop Scheduling. SCI, vol. 230, pp. 21–51. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  19. Tasgetiren, M.F., Pan, Q.-K., Suganthan, P.N., Chua, T.-J.: A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion. International Journal of Production Research, 1–18 (2010); iFirst

    Google Scholar 

  20. Storn, R., Price, K.: Differential Evolution - A Simple and Efficient Heuristic for Global Optimization over Continuous Space. Journal of Global Optimization 11, 341–359 (1997)

    CrossRef  MathSciNet  MATH  Google Scholar 

  21. Das, S., Suganthan, P.N.: Differential Evolution: A survey of the State-of-the-Art. IEEE Transaction on Evolutionary Computation (2011) (in press)

    Google Scholar 

  22. Nawaz, M., Enscore Jr., E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. Omega 11(1), 91–95 (1983)

    CrossRef  Google Scholar 

  23. Ruiz, R., Stützle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177(3), 2033–2049 (2007)

    CrossRef  MATH  Google Scholar 

  24. Deng, G., Gu, X.: A hybrid discrete differential evolution algorithm for the no-idle permutation flowshop scheduling problem with makespan criterion. Computers & Operations Research (2011), doi:10.1016/j.cor.2011.10.024

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tasgetiren, M.F., Pan, QK., Suganthan, P.N., Buyukdagli, O. (2012). A Variable Iterated Greedy Algorithm with Differential Evolution for Solving No-Idle Flowshops. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds) Swarm and Evolutionary Computation. EC SIDE 2012 2012. Lecture Notes in Computer Science, vol 7269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29353-5_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29353-5_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29352-8

  • Online ISBN: 978-3-642-29353-5

  • eBook Packages: Computer ScienceComputer Science (R0)