Skip to main content
SpringerLink
Log in

Using ant colony optimization to solve hybrid flow shop scheduling problems

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

Abstract

In recent years, most researchers have focused on methods which mimic natural processes in problem solving. These methods are most commonly termed “nature-inspired” methods. Ant colony optimization (ACO) is a new and encouraging group of these algorithms. The ant system (AS) is the first algorithm of ACO. In this study, an improved ACO method is used to solve hybrid flow shop (HFS) problems. The n-job and k-stage HFS problem is one of the general production scheduling problems. HFS problems are NP-hard when the objective is to minimize the makespan [1]. This research deals with the criterion of makespan minimization for HFS scheduling problems. The operating parameters of AS have an important role on the quality of the solution. In order to achieve better results, a parameter optimization study is conducted in this paper. The improved ACO method is tested with benchmark problems. The test problems are the same as those used by Carlier and Neron (RAIRO-RO 34(1):1–25, 2000), Neron et al. (Omega 29(6):501–511, 2001), and Engin and Döyen (Future Gener Comput Syst 20(6):1083–1095, 2004). At the end of this study, there will be a comparison of the performance of the proposed method presented in this paper and the branch and bound (B&B) method presented by Neron et al. (Omega 29(6):501–511, 2001). The results show that the improved ACO method is an effective and efficient method for solving HFS problems.

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

Access this article

Log in via an institution

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. Linn R, Zhang W (1999) Hybrid flow shop scheduling: a survey. Comput Ind Eng 37(1):57–61

    Article  Google Scholar 

  2. Carlier J, Neron E (2000) An exact method for solving the multiprocessor flow-shop. RAIRO-RO 34(1):1–25

    Article  MATH  MathSciNet  Google Scholar 

  3. Neron E, Baptiste P, Gupta JND (2001) Solving hybrid flow shop problem using energetic reasoning and global operations. Omega 29(6):501–511

    Article  Google Scholar 

  4. Engin O, Döyen A (2004) A new approach to solve hybrid flow shop scheduling problems by artificial immune system. Future Gener Comput Syst 20(6):1083–1095

    Article  Google Scholar 

  5. Gupta JND (1988) Two-stage, hybrid flowshop scheduling problem. J Oper Res Soc 39(4):359–364

    Article  MATH  Google Scholar 

  6. Arthanari TS, Ramamurthy KG (1971) An extension of two machines sequencing problem. Opsearch 8(1):10–22

    MathSciNet  Google Scholar 

  7. Brah SA, Hunsucker JL (1991) Branch and bound algorithm for the flow shop with multiple processors. Eur J Oper Res 51(1):88–99

    Article  MATH  Google Scholar 

  8. Portmann M-C, Vignier A, Dardilhac D, Dezalay D (1998) Branch and bound crossed with GA to solve hybrid flowshops. Eur J Oper Res 107(2):389–400

    Article  MATH  Google Scholar 

  9. Santos DL, Hunsucker JL, Deal DE (1995) Global lower bounds for flow shops with multiple processors. Eur J Oper Res 80(1):112–120

    Article  MATH  Google Scholar 

  10. Gupta JND, Hariri AMA, Potts CN (1994) Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Ann Oper Res 69(0):171–191

    Google Scholar 

  11. Moursli O, Pochet YA (2000) A branch-and-bound algorithm for the hybrid flowshop. Int J Prod Econ 64(1):113–125

    Article  Google Scholar 

  12. Gupta JND, Tunç EA (1994) Scheduling a two-stage hybrid flowshop with separable setup and removal times. Eur J Oper Res 77(3):415–428

    Article  MATH  Google Scholar 

  13. Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n-job, m-machine sequencing problem. Manage Sci 16(10):B630–B637

    Google Scholar 

  14. Gupta JND (1971) A functional heuristic algorithm for the flow shop scheduling problem. Oper Res Q 22(1):39–47

    Article  MATH  Google Scholar 

  15. Brah SA, Loo LL (1999) Heuristics for scheduling in a flow shop with multiple processors. Eur J Oper Res 113(1):113–122

    Article  MATH  Google Scholar 

  16. Riane F, Artiba A, Elmaghraby SE (1998) A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan. Eur J Oper Res 109(2):321–329

    Article  MATH  Google Scholar 

  17. Negenmann EG (2001) Local search algorithms for the multiprocessor flow shop scheduling problem. Eur J Oper Res 128(1):147–158

    Article  Google Scholar 

  18. Wardono B, Fathi YA (2004) Tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. Eur J Oper Res 155(2):380–401

    Article  MATH  MathSciNet  Google Scholar 

  19. Allaoui H, Artiba A (2004) Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Comput Ind Eng 47(4):431–450

    Article  Google Scholar 

  20. Allaoui H, Artiba A (2006) Scheduling two-stage hybrid flow shop with availability constraints. Comput Ind Eng 33(5):1399–1419

    MATH  MathSciNet  Google Scholar 

  21. Sahni SK (1976) Algorithms for scheduling independent tasks. J ACM 23(1):116–127

    Article  MATH  MathSciNet  Google Scholar 

  22. Narasimhan SL, Panwalker SS (1984) Scheduling in a two-stage manufacturing process. Int J Prod Res 22(4):555–564

    Article  Google Scholar 

  23. Dessouky MM, Dessouky MI, Verma S (1998) Flowshop scheduling with identical jobs and uniform parallel machines. Eur J Oper Res 109(3):620–631

    Article  MATH  Google Scholar 

  24. Verma S, Dessouky MM (1999) Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines. J Sched 2(3):135–150

    Article  MATH  MathSciNet  Google Scholar 

  25. Schuurman P, Woeginger GJ (2000) A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. Theor Comp Sci 237(1–2):105–122

    Article  MATH  MathSciNet  Google Scholar 

  26. Ohno K, Jin ZH, Ito T, Elmaghraby SE (2002) Scheduling hybrid flowshops in printed circuit board assembly lines. Prod Oper Manag 11(2):216–230

    Google Scholar 

  27. Choi I-C, Kim S-I, Kim H-S ( 2003) A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem. Comput Oper Res 30(5):773–786

    Article  MATH  MathSciNet  Google Scholar 

  28. Ulder NLJ, Aarts EHL, Bandelt H-J, van Laarhoven PJM, Pesch E (1990) Genetic local search algorithms for the travelling salesman problem. Lect Notes Comput Sci 496:109–119

    Article  Google Scholar 

  29. Charon I, Hudry O (2000) Application of the noising method to the travelling salesman problem. Eur J Oper Res 125(2):266–277

    Article  MATH  MathSciNet  Google Scholar 

  30. Bevilacqua A (2002) A methodological approach to parallel simulated annealing on an SMP system. J Parallel Distrib Comput 62(10):1548–1570

    MATH  Google Scholar 

  31. Stützle T, Hoos HH (1998) Improvements on the ANT System: introducing the MAX-MIN Ant System. In: RF Albrecht, GD Smith, NC Steele (Eds) Proceedings of the 3rd International Conference on Artificial Neural Networks and Genetic Algorithms (ICANNGA’97), Norwich, UK, April 1997, pp 245–249

  32. Merkle D, Middendorf M (2001) A New approach to solve permutation scheduling problems with ant colony optimization. Applications of evolutionary computing. In: Proceedings of EvoWorkshops 2001, Como, Italy, April 2001, pp 484–494

  33. Chandrasekharan R, Ziegler H (2005) Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. Comput Ind Eng 48(4):789–797

    Article  Google Scholar 

  34. Shyu SJ, Lin BMT, Yin PY (2004) Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time. Comput Ind Eng 47(2–3):181–193

    Article  Google Scholar 

  35. Ying K-C, Liao C-J (2004) An ant colony system for permutation flow shop sequencing. Comput Oper Res 31(5):791–801

    Article  MATH  Google Scholar 

  36. Dorigo M, Maniezzo V, Colorni A (1991) Positive feedback as a search strategy. Technical report 91–016, Dip. Elettronica, Politecnico di Milano, Italy

  37. Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern B 26(1):29–41

    Article  Google Scholar 

  38. Gambardella LM, Dorigo M (1995) Ant-Q: a reinforcement learning approach to the traveling salesman problem. In: Proceedings of the 12th International Conference on Machine Learning (ML’96), Tahoe City, California, July 1995, pp 252–260

  39. Dorigo M, Gambardella LM (1997) Ant colonies for the traveling salesman problem. Biosystems 43(1):73–81

    Article  Google Scholar 

  40. Bullnheimer B, Hartl RF, Strauss C (1997) A new rank-based version of the ant system: a computational study. Technical report POM-03/97, Institute of Management Science, University of Vienna, Austria

  41. Maniezzo V (1998) Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS J Comput 11(4):358–369

    Article  MathSciNet  Google Scholar 

  42. Maniezzo V, Colorni A (1999) The ant system applied to the quadratic assignment problem. IEEE Trans Knowl Data Eng 11(5):769–778

    Article  Google Scholar 

  43. Gambardella LM, Taillard ED, Dorigo M (1999) Ant colonies for the quadratic assignment problem. J Oper Res Soc 50(2):167–176

    Article  MATH  Google Scholar 

  44. Bullnheimer B, Hartl RF, Strauss C (1997) Applying the ant system to the vehicle routing problem. In: Proceedings of the 2nd International Conference on Metaheuristics (MIC’97), Sophia Antipolis, France, July 1997

  45. Gambardella LM, Taillard E, Agazzi G (1999) MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. Technical report, IDSIA, pp 1–17

  46. Schoonderwoerd R, Holland OE, Bruten JL, Rothkrantz LJM (1996) Ant-based load balancing in telecommunications networks. Adapt Behav 5(2):169–207

    Article  Google Scholar 

  47. White T, Pagurek B, Oppacher F (2000) ASGA: improving the ant system by integration with genetic algorithms. Systems and Computer Engineering Department, Carleton University Press

  48. Di Caro G, Dorigo M (1998) Extending AntNet for best-effort quality-of-service routing. In: Proceedings of the 1st International Workshop on Ant Colony Optimization (ANT’98), From Ant Colonies to Artificial Ants, Brussels, Belgium, October 1998

  49. Bonabeau E, Henaux F, Guérin S, Snyers D, Kuntz P, Theraulaz G (1998) Routing in telecommunication networks with “Smart” ant-like agents. In: Proceedings of the 2nd International Workshop on Intelligent Agents for Telecommunication Applications (IATA’98), Paris, France, July 1998, Lectures Notes in Computer Science, vol 1437

  50. Di Caro G, Dorigo M (1997) AntNet: a mobile agents approach to adaptive routing. Technical report IRIDIA/97-12, IRIDIA, Universite Libre de Bruxelles, Belgium

  51. Subramanian D, Druschel P, Chen J (1997) Ants and reinforcement learning: a case study in routing in dynamic networks. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI’97), Nagoya, Japan, August 1997, pp 832–838

  52. Heusse M, Snyers D, Guérin S, Kuntz P (1998) Adaptive agent-driven routing and load balancing in communication networks. Adv Complex Syst 1(2–3):237–254

    Article  Google Scholar 

  53. van der Put R, Rothkrantz L (1998) Routing in packet switched networks using agents. Simulat Pract Theory (in press)

  54. Costa D, Hertz A (1997) Ants can colour graphs. J Oper Res Soc 48(3):295–305

    Article  MATH  Google Scholar 

  55. Gambardella LM, Dorigo M (1997) HAS-SOP: hybrid ant system for the sequential ordering problem. Technical report IDSIA-11–97, IDSIA, Lugano, Switzerland

  56. Dorigo M, Di Caro G, Gambardella LM (1998) Ant algorithms for discrete optimization, Technical report, IDSIA, Lugano, Switzerland

  57. Colorni A, Dorigo M, Maniezzo V, Trubian M (1994) Ant system for job-shop scheduling. Belg J Oper Res 34(1):39–53

    Google Scholar 

  58. Ventresca M, Ombuki B (2004) Ant colony optimization for job shop scheduling problem. In: Proceedings of the 8th International Conference on Artificial Intelligence and Soft Computing (ASC 2004), Marbella, Spain, September 2004, CDROM 451–152

  59. Zhang H, Gen M, Fujimura S, Kim KW (2004) Hybrid ant colony optimization for job shop scheduling problem. In: Proceedings of the 20th Fuzzy System Symposium, Kitakyushu, Japan, June 2004, pp 304–305

  60. Blum C (2002) ACO applied to group shop scheduling: a case study on intensification and diversification. In: Dorigo M, Di Caro G, Sampels M (Eds) Proceedings of ANTS 2002, the 3rd International Workshop on Ant Algorithms, Brussels, Belgium, September 2002, Lecture Notes in Computer Science 2463/2002

  61. Blum C (2005) Beam-ACO—hybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput Oper Res 32(6):1565–1591

    Article  Google Scholar 

  62. Rajendran C, Ziegler H (2004) Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flow time of jobs. Eur J Oper Res 155(2):426–438

    Article  MATH  MathSciNet  Google Scholar 

  63. Rajendran C, Ziegler H (2005) Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. Comput Ind Eng 48(4):789–797

    Article  Google Scholar 

  64. Gajpal Y, Rajendran C (2006) An ant colony optimization algorithm for minimizing the completion-time variance of jobs in flow shops. Int J Prod Econ 101(2):259–273

    Article  Google Scholar 

  65. den Beste M, Stützle T, Dorigo M (2000) Ant colony optimization for the total weighted tardiness problem. In: Proceedings of the 6th International Conference on Parallel Problem Solving from Nature (PPSN 2000), Paris, France, September 2000

  66. Eggers J, Feillet D, Kehl S, Wagner MO, Yannou B (2003) Optimization of the keyboard arrangement problem using an Ant Colony algorithm. Eur J Oper Res 148(3):672–686

    Article  MATH  MathSciNet  Google Scholar 

  67. Roli A, Blum C, Dorigo M (2001) ACO for maximal constraint satisfaction problems. In: Proceedings of the 4th Metaheuristics International Conference (MIC 2001), Porto, Portugal, July 2001, pp 187–191

  68. Bautista J, Pereira J (2002) Ant colonies for RCPS problem. In: Proceedings of the 5th Catalonian Conference on AI (CCIA 2002), Topics in Artificial Intelligence, Castellón, Spain, October 2002, Lecture Notes in Artificial Intelligence, vol 2504, pp 257–268

  69. Merkle D, Middendorf M, Schmeck, H (2002) Ant colony optimization for resource-constrained project scheduling. IEEE Trans Evol Comput 6(4):333–346

    Article  Google Scholar 

  70. Luo S, Wang C, Wang J (2003) Ant colony optimization for resource-constrained project scheduling with generalized precedence relations. In: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), Sacramento, California, November 2003, pp 284–288

  71. Solimanpur M, Vrat P, Shankar R (2004) Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing. Eur J Oper Res 157(3):592–606

    Article  MATH  MathSciNet  Google Scholar 

  72. McKendall AR Jr, Shang J (2006) Hybrid ant systems for the dynamic facility layout problem. Comput Oper Res 33(3):790–803

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Gazi University, Ankara, Turkey

    Kemal Alaykýran

  2. Department of Industrial Engineering, Faculty of Engineering, Selçuk University (Alladdin Keykubat Kampüsü Selçuklu), Konya, 42079, Turkey

    Orhan Engin

  3. Department of Industrial Engineering, Boğaziçi University, Istanbul, Turkey

    Alper Döyen

Authors
  1. Kemal Alaykýran
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Orhan Engin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alper Döyen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Orhan Engin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alaykýran, K., Engin, O. & Döyen, A. Using ant colony optimization to solve hybrid flow shop scheduling problems. Int J Adv Manuf Technol 35, 541–550 (2007). https://doi.org/10.1007/s00170-007-1048-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-007-1048-2

Keywords

Search

Navigation