Advertisement

A Novel Artificial Bee Colony Algorithm for Robust Permutation Flowshop Scheduling

  • Shijing Ma
  • Yunhe Wang
  • Mingjie Li
Chapter
Part of the Unsupervised and Semi-Supervised Learning book series (UNSESUL)

Abstract

Because of the importance of the permutation flowshop scheduling problem, a variety of researches are being focused on this issue and numerous algorithms have been proposed. However, many uncertainties may exist in real production environment of the permutation flowshop problem. In order to solve this obstacle, an optimization criterion of maximizing the probability of ensuring the makespan not surpass the expected finish time is considered for M-machine permutation flowshop in this chapter. A schedule for this optimization criterion is called the robust schedule. A novel artificial bee colony (ABC) algorithm integrated with an efficient local search is proposed. The local search introduces into a probability model to determine whether the new generated solution should be accepted. For experiment analysis, the performance of proposed ABC is evaluated on the well-known Car and Rec permutation flowshop problems which are taken from OR library and is compared with an improved genetic algorithm and NEH heuristic. The comparison results indicate that the proposed ABC performs well and can give better robust schedules for M-machine permutation flowshop problem.

Keywords

Robust scheduling Permutation flowshop Artificial bee colony algorithm 

References

  1. 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–110MathSciNetCrossRefGoogle Scholar
  2. 2.
    Pierreval H, Durieux-Paris S (2007) Robust simulation with a base environmental scenario. Eur J Oper Res 182:783–793CrossRefGoogle Scholar
  3. 3.
    Goren S, Sabuncuoglu I (2008) Robustness and stability measures for scheduling: single-machine environment. IIE Trans 40:66–83CrossRefGoogle Scholar
  4. 4.
    Li Z, Ierapetritou M (2008) Process scheduling under uncertainty: review and challenges. Comput Chem Eng 32:715–727CrossRefGoogle Scholar
  5. 5.
    Herroeleny W, Leus R (2004) Robust and reactive project scheduling: a review and classification of procedures. Int J Prod Res 42(8):1599–1620CrossRefGoogle Scholar
  6. 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–28CrossRefGoogle Scholar
  7. 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–645CrossRefGoogle Scholar
  8. 8.
    Feiza G, Henri P, Hajri-Gabouj S (2010) Analysis of robustness in proactive scheduling: a graphical approach. Comput Ind Eng 58:193–198CrossRefGoogle Scholar
  9. 9.
    Sabuncuoglu I, Goren S (2009) Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research. Int J Comput Integr Manuf 22(2):138–157CrossRefGoogle Scholar
  10. 10.
    Kouvelis P, Daniels RL, Vairaktarakis G (2000) Robust scheduling of a two-machine flowshop with uncertain processing times. IIE Trans 32(5):421–432Google Scholar
  11. 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–67Google Scholar
  12. 12.
    Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer Academic Publishers, BostonCrossRefGoogle Scholar
  13. 13.
    Daniels RL, Kouvelis P (1995) Robust scheduling to hedge against processing time uncertainty in single-stage production. Manag Sci 41:363–376CrossRefGoogle Scholar
  14. 14.
    Kaperski A (2005) Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion. Oper Res Lett 33:431–436MathSciNetCrossRefGoogle Scholar
  15. 15.
    Yang J, Yu G (2002) On the robust single machine scheduling problem. J Comb Optim 6:17–33MathSciNetCrossRefGoogle Scholar
  16. 16.
    Liu L, Gu HY, Xi YG (2007) Robust and stable scheduling of a single machine with random machine breakdowns. Int J Adv Manuf Technol 31:645–654CrossRefGoogle Scholar
  17. 17.
    Daniels RL, Carrillo JE (1997) β-Robust scheduling for single machine systems with uncertain processing times. IIE Trans 29:977–985Google Scholar
  18. 18.
    Wu CW, Brown KN, Beck JC (2009) Scheduling with uncertain durations: modeling β-robust scheduling with constraints. Comput Oper Res 36:2348–2356MathSciNetCrossRefGoogle Scholar
  19. 19.
    Liu Q, Ullah S, Zhang C (2011) An improved genetic algorithm for robust permutation flowshop scheduling. Int J Adv Manuf Technol 56:345–354CrossRefGoogle Scholar
  20. 20.
    Nawaz M, Enscore E, Ham I (1983) A heuristic algorithm for the m-machine, n-machine flow shop sequencing problem. Omega 11:91–95CrossRefGoogle Scholar
  21. 21.
    Teixidor AB (2006) Proactive management of uncertainty to improve scheduling robustness in process industries. PhD thesis, Universitat Politμecnica de Catalunya BarcelonaGoogle Scholar
  22. 22.
    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–382Google Scholar
  23. 23.
    Allen E (2007) Modeling with Itô stochastic differential equation. Springer, DordrechtzbMATHGoogle Scholar
  24. 24.
    Hayter AJ (1996) Probability and statistics for engineers and scientists. PWB Publishing, DuxburyGoogle Scholar
  25. 25.
    Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459–471MathSciNetCrossRefGoogle Scholar
  26. 26.
    Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8(1):687–697CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2019

Authors and Affiliations

  • Shijing Ma
    • 1
  • Yunhe Wang
    • 1
  • Mingjie Li
    • 1
  1. 1.College of Computer Science and Information TechnologyNortheast Normal UniversityChangchunChina

Personalised recommendations