SpringerLink
Log in

An improved genetic algorithm for robust permutation flowshop scheduling

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

In order to deal with uncertainties, a robust schedule for M-machine permutation flowshop is proposed. The presented robust schedule is aimed to maximize the probability of ensuring that makespan will not exceed the expected completion time. An improved genetic algorithm (GA) with a new generation scheme is developed, which can preserve good characteristics of parents in the new generation. Experiments are performed to get robust schedules for well-known Car and Rec permutation flowshop problems, taken from OR library. The schedules obtained from the improved GA are compared with the schedules formed by well-known heuristic in literature. Computational results show that the permutation flowshop schedules obtained from improved GA are robust to produce an affirmative percentage increase in the probability of getting makespan less than expected completion time.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aytug H, Lawley MA, McKay K, Mohan S, Uzsoy R (2005) Executing production schedules in the face of uncertainties: a review and some future directions. Eur J Oper Res 161:86–110

    Article  MathSciNet  MATH  Google Scholar 

  2. Pierreval H, Durieux-Paris S (2007) Robust simulation with a base environmental scenario. Eur J Oper Res 182:783–793

    Article  MATH  Google Scholar 

  3. Goren S, Sabuncuoglu I (2008) Robustness and stability measures for scheduling: single-machine environment. IIE Trans 40:66–83

    Article  Google Scholar 

  4. Li Z, Ierapetritou M (2008) Process scheduling under uncertainty: review and challenges. Comput Chem Eng 32:715–727

    Article  Google Scholar 

  5. Herroeleny W, Leus R (2004) Robust and reactive project scheduling: a review and classification of procedures. Int J Prod Res 42(8):1599–1620

    Article  Google Scholar 

  6. Lan S, Clarke J, Barnhart C (2006) Planning for robust airline operations optimizing aircraft routings and flight departure times to minimize passenger disruptions. Transp Sci 40(1):15–28

    Article  Google Scholar 

  7. Tang L, Wang X (2008) A predictive reactive scheduling method for color-coating production in steel industry. Int J Adv Manuf Technol 35:633–645

    Article  MathSciNet  Google Scholar 

  8. Feiza G, Henri P, Hajri-Gabouj S (2010) Analysis of robustness in proactive scheduling: a graphical approach. Comput Ind Eng 58:193–198

    Article  Google Scholar 

  9. Sabuncuoglu I, Goren S (2009) Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research. Int J Computer Integr Manuf 22(2):138–157

    Article  Google Scholar 

  10. Kouvelis P, Daniels RL, Vairaktarakis G (2000) Robust scheduling of a two-machine flowshop with uncertain processing times. IIE Trans 32(5):421–432

    Google Scholar 

  11. Kuo CY, Lin FJ (2002) Relative robustness for single-machine scheduling problem with processing time uncertainty. J Chin Inst Ind Eng 19(5):59–67

    Google Scholar 

  12. Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer Academic Publishers, Boston

    MATH  Google Scholar 

  13. Daniels RL, Kouvelis P (1995) Robust scheduling to hedge against processing time uncertainty in single-stage production. Manage Sci 41:363–376

    Article  MATH  Google Scholar 

  14. Kaperski A (2005) Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion. Oper Res Lett 33:431–436

    Article  MathSciNet  Google Scholar 

  15. Yang J, Yu G (2002) On the robust single machine scheduling problem. J Comb Optim 6:17–33

    Article  MathSciNet  MATH  Google Scholar 

  16. Liu L, Gu HY, ** YG (2007) Robust and stable scheduling of a single machine with random machine breakdowns. Int J Adv Manuf Technol 31:645–654

    Article  Google Scholar 

  17. Daniels RL, Carrillo JE (1997) β-Robust scheduling for single-machine systems with uncertain processing times. IIE Trans 29:977–985

    Google Scholar 

  18. Wu CW, Brown KN, Beck JC (2009) Scheduling with uncertain durations: modeling β-robust scheduling with constraints. Comput Oper Res 36:2348–2356

    Article  MathSciNet  MATH  Google Scholar 

  19. Teixidor AB (2006) Proactive management of uncertainty to improve scheduling robustness in process industries. PhD thesis, Universitat Politμecnica de Catalunya Barcelona

  20. Hapke M, Jaskievicz A, Slowinski R (1999) Fuzzy multimode resource-constrained project scheduling with multiple objectives. In: Weglarz J (ed) Project scheduling recent models, algorithms and applications. Kluwer Academic Publishers, Dordrecht, pp 355–382

    Google Scholar 

  21. Allen E (2007) Modeling with Itô stochastic differential equation. Springer, Dordrecht

    Google Scholar 

  22. Hayter AJ (1996) Probability and statistics for engineers and scientists. PWB Publishing, Duxbury

    Google Scholar 

  23. Chen CL, Vempati VS, Aljaber N (1995) An application of genetic algorithms for flow shop problems. Eur J Oper Res 80:389–396

    Article  Google Scholar 

  24. Reeves CR (1995) A genetic algorithm for flow shop sequencing. Comput Oper Res 22(1):5–13

    Article  MATH  Google Scholar 

  25. Murata T, Ishibuchi H, Tanaka H (1996) Genetic algorithms for flowshop scheduling problems. Comput Ind Eng 30:1061–1071

    Article  Google Scholar 

  26. Etiler O, Toklu B, Atak M, Wilson J (2004) A genetic algorithm for flow shop scheduling problems. J Oper Res Soc 55:830–835

    Article  MATH  Google Scholar 

  27. Ruiz R, Maroto C, Alcaraz J (2006) Two new robust genetic algorithms for the flowshop scheduling problem. Omega–Int J Manage S 34:461–476

    Article  Google Scholar 

  28. Zhang BT, Kim JJ (2000) Comparison of selection methods for evolutionary optimization. Evolutionary Optimization an International Journal 2(1):55–70

    Google Scholar 

  29. Sivanandam SN, Deepa SN (2008) Introduction to genetic algorithms. Springer, Berlin

    MATH  Google Scholar 

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

    Article  Google Scholar 

  31. Turner S, Booth D (1987) Comparison of heuristics for flow shop sequencing. Int J Manag Sci 15:75–85

    Google Scholar 

  32. Ruiz R, Maroto C (2005) A comprehensive review and evaluation of permutation flowshop heuristics. Eur J Oper Res 165:479–494

    Article  MathSciNet  MATH  Google Scholar 

  33. Gupta JND, Koulamas C, Kyparisis GJ (2006) Perfomance guarantees for flowshop heuristics to minimize makespan. Eur J Oper Res 169:865–872

    Article  MathSciNet  MATH  Google Scholar 

  34. Kalczynski PJ, Kamburowski J (2007) On the NEH heuristic for minimizing the makespan in permutation flowshops. Omega–Int J Manage S 35(1):53–60

    Article  Google Scholar 

  35. Carlier J (1978) Ordonnancements a contraintes disjunctives, RAIRO Recherche operations Elle. Oper Res 12:333–351

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan, 430074, Hubei, People’s Republic of China

    Qiong Liu, Saif Ullah & Chaoyong Zhang

Authors
  1. Qiong Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Saif Ullah
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chaoyong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chaoyong Zhang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, Q., Ullah, S. & Zhang, C. An improved genetic algorithm for robust permutation flowshop scheduling. Int J Adv Manuf Technol 56, 345–354 (2011). https://doi.org/10.1007/s00170-010-3149-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-010-3149-6

Keywords

Search

Navigation