Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Ant colony optimization for job shop scheduling using multi-attribute dispatching rules

  • 1467 Accesses

  • 20 Citations

Abstract

This paper proposes a heuristic method based on ant colony optimization to determine the suboptimal allocation of dynamic multi-attribute dispatching rules to maximize job shop system performance (four measures were analyzed: mean flow time, max flow time, mean tardiness, and max tardiness). In order to assure high adequacy of the job shop system representation, modeling is carried out using discrete-event simulation. The proposed methodology constitutes a framework of integration of simulation and heuristic optimization. Simulation is used for evaluation of the local fitness function for ants. A case study is used in this paper to illustrate how performance of a job shop production system could be affected by dynamic multi-attribute dispatching rule assignment.

References

  1. 1.

    Rajendran C, Holthaus O (1999) A comparative study of dispatching rules in dynamic flowshops and jobshops. Eur J Oper Res 116:156–170

  2. 2.

    Lengyel A, Hatono I, Ueda K (2003) Scheduling for on-time completion in job shops using feasibility function. Comput Ind Eng 45:215–229

  3. 3.

    Iravani F, Balcıoglu B (2008) On priority queues with impatient customers. Queueing Syst 58:239–260

  4. 4.

    Pardo MJ, de la Fuente D (2007) Optimizing a priority-discipline queuing model using fuzzy set theory. Comput Math Appl 54:267–281

  5. 5.

    Krishnamoorthy A, Babu S, Narayanan VC (2009) The MAP/(PH/PH)/1 queue with self-generation of priorities and non-preemptive service. Eur J Oper Res 195:174–185

  6. 6.

    Walraevens J, Steyaert B, Bruneel H (2006) A preemptive repeat priority queue with resampling: performance analysis. Ann Oper Res 146:189–202

  7. 7.

    Van Houdt B, Blondia C (2006) Analyzing priority queues with 3 classes using tree-like processes. Queueing Syst 54:99–109

  8. 8.

    Katayama T (2007) Analysis of a time-limited service priority queueing system with exponential timer and server vacations. Queueing Syst 57:169–178

  9. 9.

    Chiang TC, Fu LC (2007) Using dispatching rules for job shop scheduling with due-date based objectives. Int J Prod Res 45:3245–3262

  10. 10.

    Yang T, Tseng LP (2002) Solving a multiple objective simulation model using a hybrid response surface method and lexicographical goal programming approach—a case study on IC ink marking machines. J Oper Res Soc 53:211–221

  11. 11.

    Kim Y-D, Kim J-U, Lim S-K, Jun H-B (1998) Due-date based scheduling and control policies in a multiproduct semiconductor wafer fabrication facility. IEEE T Semiconduct M IEEE T Semiconduct M 11:155–164

  12. 12.

    Zhang H, Jiang Z, Guo C (2009) Simulation-based optimization of dispatching rules for semiconductor wafer fabrication system scheduling by the response surface methodology. Int J Adv Manuf Technol 41:110–121

  13. 13.

    Bocewicz G, Wójcik R, Banaszak Z. (2008) AGVs distributed control subject to imprecise operation times. In: Agent and multi-agent systems: technologies and applications, LNAI 4953: 421–430

  14. 14.

    Chan FTS, Chan HK, Lau HCW, Ip RWL (2003) Analysis of dynamic dispatching rules for a flexible manufacturing system. J Mater Process Tech 138:325–331

  15. 15.

    Chan FTS (2003) Effects of dispatching and routing decisions on the performance of a flexible manufacturing system. Int J Adv Manuf Technol 21:328–338

  16. 16.

    Blackstone JH, Philips DT, Hogg GL (1982) A state-of-the survey of dispatching rules for manufacturing job shop operations. Int J Prod Res 20:27–45

  17. 17.

    Dominic PDD, Kaliyamoorthy S, Saravana Kumar M (2004) Efficient dispatching rules for dynamic job shop scheduling. Int J Adv Manuf Technol 24:70–75

  18. 18.

    Jayamohan MS, Rajendran C (2000) New dispatching rules for shop scheduling: a step forward. Int J Prod Res 38:563–586

  19. 19.

    Holthaus O, Rajendrant C (1997) New dispatching rules for scheduling in a job shop—an experimental study. Int J Adv Manuf Technol 13:148–153

  20. 20.

    Yin YL, Rau H (2006) Dynamic selection of sequencing rules for a class-based unit-load automated storage and retrieval system. Int J Adv Manuf Technol 29:1259–1266

  21. 21.

    Vinod V, Sridharan R (2011) Simulation modeling and analysis of due-date assignment methods and scheduling decision rules in a dynamic job shop production system. Int J Prod Econ 129:127–146

  22. 22.

    Kim DW, Kim KH, Jang W, Chen FF (2002) Unrelated parallel machine scheduling with setup times using simulated annealing. Robot Cim-Int Manuf 18:223–231

  23. 23.

    Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job-shop problem. Manage Sci 42:797–813

  24. 24.

    Pezella F, Merelli E (2000) A tabu search method guided by shifting bootleneck for the job shop scheduling. Eur J Oper Res 120:297–310

  25. 25.

    Sabuncuoglu I, Bayiz M (1999) Job shop scheduling with beam search. Eur J Oper Res 118:390–412

  26. 26.

    Huang M, Wu T, Liang X (2010) GA-ACO in job-shop schedule problem research. Comput Intel Syst 107:226–233

  27. 27.

    Avila Rondon RL, Carvalho AS (2009) Solving a real job shop scheduling. Industrial Electronics. IECON '09. 35th Annual Conference of IEEE: 2494–2498

  28. 28.

    Lu MS, Romanowski R (2012) Multi-contextual ant colony optimization of intermediate dynamic job shop problems. Int J Adv Manuf Technol 60:667–681

  29. 29.

    Liao CJ, Tsai YL, Chao CW (2011) An ant colony optimization algorithm for setup coordination in a two-stage production system. Appl Soft Comput 11:4521–4529

  30. 30.

    Dorigo M, Stutzle T (2010) Ant colony optimization: overview and recent advances. In: Gendreau M, Potvin JY (eds) Handbook of metaheuristics, vol 146, Secondth edn. Springer, New York, p 561, Chapter 8

  31. 31.

    Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE T Evolut Comput 1:53–66

  32. 32.

    Nonsiri S, Supratid S (2008) Modifying ant colony optimization. IEEE Conference on Soft Computing in Industrial Applications. June 25–27. Muroran. Japan: 95–100

  33. 33.

    Stützle T, Hoos HH (2000) MAX-MIN ant system. Future Gen Comput Systems 16(8):889–914

  34. 34.

    Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Systems Man Cybernet-Part B 26:29–41

  35. 35.

    Dorigo M, Blumb C (2005) Ant colony optimization theory: a survey. Theor Comput Sci 344:243–278

  36. 36.

    Enns ST (1995) A dynamic forecasting model for job shop flow time prediction and tardiness control. Int J Prod Res 33:1295–1312

  37. 37.

    Udhayakumar P, Kumanan S (2011) Integrated scheduling of flexible manufacturing system using evolutionary algorithms. Int J Adv Manuf Technol Int J Adv Manuf Technol 61:621–635, 2012

Download references

Author information

Correspondence to Przemysław Korytkowski.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.

Reprints and Permissions

About this article

Cite this article

Korytkowski, P., Rymaszewski, S. & Wiśniewski, T. Ant colony optimization for job shop scheduling using multi-attribute dispatching rules. Int J Adv Manuf Technol 67, 231–241 (2013). https://doi.org/10.1007/s00170-013-4769-4

Download citation

Keywords

  • Ant colony optimization
  • Multi-attribute dispatching rules
  • Discrete-event simulation
  • Dynamic job shop