Skip to main content

Advertisement

SpringerLink
Log in

A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic

  • Regular Research Paper
  • Published:
Memetic Computing Aims and scope Submit manuscript

Abstract

In this article, a new memetic algorithm has been proposed to solve job shop scheduling problems (JSSPs). The proposed method is a genetic-algorithm-based approach combined with a local search heuristic. The proposed local search heuristic is based on critical operations. It removes the critical operations and reassigns them to a new position to improve the fitness value of the schedule. Moreover, in this article, a new fitness function is introduced for JSSPs. The new fitness function called priority-based fitness function is defined in three priority levels to improve the selection procedure. To show the generality of our proposed method, we apply it to three different types of job scheduling problems including classical, flexible and multi-objective flexible JSSPs. The experiment results show the efficiency of the proposed fitness function. In addition, the results show that incorporating local search not only offers better solutions but also improves the convergence rate. Compared to the state-of-the-art algorithms, the proposed method outperforms the existing methods in classical JSSPs and offers competitive solutions in other types of scheduling 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. Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manag Sci 34(3): 391–401

    Article  MathSciNet  MATH  Google Scholar 

  2. Asano M, Ohta H (2002) A heuristic for job shop scheduling to minimize total weighted tardiness. Comput Ind Eng 42: 137–147

    Article  Google Scholar 

  3. Bagheri A, Zandieh M, Mahdavi I, Yazdani M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gen Comput Syst 26: 533–541

    Article  Google Scholar 

  4. Becerra RL, Coello CA (2005) A cultural algorithm for solving the job-shop scheduling problem. In: Knowledge incorporation in evolutionary computation, studies in fuzziness and soft computing, vol 167. Springer, Berlin, pp 37–55

  5. Brandimarte P (1993) Routing and scheduling in a flexible job shop by taboo search. Ann Oper Res 41: 157–183

    Article  MATH  Google Scholar 

  6. Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45: 369–375

    Article  MathSciNet  MATH  Google Scholar 

  7. Caumond A, Lacomme P, Tcherneva N (2008) A memetic algorithm for the job-shop with time-lags. Comput Oper Res 35(7): 2331–2356

    Article  MathSciNet  MATH  Google Scholar 

  8. Chen H, Ihlow J, Lehmann C (1999) A genetic algorithm for flexible job-shop scheduling. In: IEEE international conference on robotics and automation, Detroit, pp 1120–1125

  9. Chiang T-C, Cheng H-C, Fu L-C (2011) NNMA: an effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems. Exp Syst Appl 38(5): 5986–5999

    Article  Google Scholar 

  10. Croce FD, Tadei R, Volta G (1995) A genetic algorithm for the job shop problem. Comput Oper Res 22: 15–24

    Article  MATH  Google Scholar 

  11. Fonseca DJ, Navaresse D (2002) Artificial neural networks for job shop simulation. Adv Eng Inform 16(4): 241–246

    Article  Google Scholar 

  12. Gao J, Gen M, Sun L, Zhao X (2007) A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems. Comput Ind Eng 53(1): 149–162

    Article  MATH  Google Scholar 

  13. Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res 35(9): 2892–2907

    Article  MathSciNet  MATH  Google Scholar 

  14. Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1: 117–129

    Article  MathSciNet  MATH  Google Scholar 

  15. Goncalves JF, de Magalhaes Mendes JJ, Resende MGC (2002) A hybrid genetic algorithm for the job shop scheduling problem. Technical report TD-5EAL6J, AT&T Labs

  16. Hasan SMK, Sarker R, Cornforth D (2007) Hybrid genetic algorithm for solving job-shop scheduling problem. In: 6th IEEE/ACIS international conference on computer and information science, Melbourne, pp 519–524

  17. Hasan SMK, Sarker R, Cornforth D (2007) Modified genetic algorithm for job-shop scheduling: a gap-utilization technique. In: IEEE congress on evolutionary computation, Singapore, pp 3804– 3811

  18. Hasan SMK, Sarker R, Cornforth D (2008) GA with priority rules for solving job-shop scheduling problems. In: IEEE world congress on computational intelligence, Hong Kong, pp 1913–1920

  19. Hasan SMK, Sarker R, Essam D, Cornforth D (2008) Memetic algorithms for solving job-shop scheduling problems. Memetic Comp 1: 69–83

    Article  MATH  Google Scholar 

  20. Huang KL, Liao CJ (2008) Ant colony optimization combined with taboo search for the job shop scheduling problem. Comput Oper Res 35(4): 1030–1046

    Article  MathSciNet  MATH  Google Scholar 

  21. Huang WQ, Yin AH (2004) An improved shifting bottleneck procedure for the job shop scheduling problem. Comput Oper Res 31: 2093–2110

    Article  MathSciNet  MATH  Google Scholar 

  22. Hurink E, Jurisch B, Thole M (1994) Tabu search for the job shop scheduling problem with multi-purpose machines. Oper Res Spectrum 15: 205–215

    Article  MathSciNet  MATH  Google Scholar 

  23. Kacem I, Hammadi S, Borne P (2002) Approach by localization and multi objective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans Syst Man Cybernet Part C 32(1): 1–13

    Article  Google Scholar 

  24. Kacem I, Hammadi S, Borne P (2002) Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. J Math Comput Simul 60: 245–276

    Article  MathSciNet  MATH  Google Scholar 

  25. Kolonko M (1999) Some new results on simulated annealing applied to the job-shop scheduling problem. Eur J Oper Res 113: 123–136

    Article  MATH  Google Scholar 

  26. Lawrence D (1985) Job shop scheduling with genetic algorithms. In: First international conference on genetic algorithms, Mahwah, New Jersey, pp 136–140

  27. Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Master’s thesis, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania

  28. Lee KM, Yamakawa T, Lee KM (1998) A genetic algorithm for general machine scheduling problems. Int J Knowl-Based Electron 2: 60–66

    Google Scholar 

  29. Mahdavi I, Shirazi B, Solimanpur M (2010) Development of a simulation-based decision support system for controlling stochastic flexible job shop manufacturing systems. Simul Model Pract Theory 18: 768–786

    Article  Google Scholar 

  30. Mattfeld DC, Bierwirth C (2004) An efficient genetic algorithm for job shop scheduling with tardiness objectives. Eur J Oper Res 155: 616–630

    Article  MathSciNet  MATH  Google Scholar 

  31. Mobini M, Mobini Z, Rabbani M (2011) An artificial immune algorithm for the project scheduling problem under resource constraints. Appl Soft Comput 11(2): 1975–1982

    Article  Google Scholar 

  32. Moscato P (1999) Memetic algorithms: a short introduction. New Ideas Optim 14: 219–234

    Google Scholar 

  33. Raeesi N. MR, Kobti Z (2011) A machine operation lists based memetic algorithm for job shop scheduling. In: IEEE congress on evolutionary computation (CEC), New Orleans, LA, USA, June 2011, pp 2436–2443

  34. Naderi B, Fatemi Ghomi SMT, Aminnayeri M, Zandieh M (2011) Scheduling open shops with parallel machines to minimize total completion time. J Comput Appl Math 235(5): 1275–1287

    Article  MathSciNet  MATH  Google Scholar 

  35. Ombuki BM, Ventresca M (2004) Local search genetic algorithms for the job shop scheduling problem. Appl Intell 21: 99–109

    Article  MATH  Google Scholar 

  36. Ong YS, Keane AJ (2004) Meta-lamarckian learning in memetic algorithms. IEEE Trans Evol Comput 8: 99–110

    Article  Google Scholar 

  37. Ong ZX, Tay JC, Kwoh CK (2005) Applying the clonal selection principle to find flexible job-shop schedules. In: LNCS, vol 3627, pp 442–455

  38. Park BJ, Choi HR, Kim HS (2003) A hybrid genetic algorithm for the job shop scheduling problems. Comput Ind Eng 45: 597–613

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  40. Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible jobshop scheduling problem. Comput Oper Res 35(10): 3202–3212

    Article  MATH  Google Scholar 

  41. Wang CQ, Cao YF, Dai GZ (2005) Bi-directional convergence aco for job-shop scheduling. Comput Integr Manuf Syst 10(7): 820–824

    Google Scholar 

  42. Watanabe M, Ida K, Gen M (2005) A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem. Comput Ind Eng 48: 743–752

    Article  Google Scholar 

  43. Xing L-N, Chen Y-W, Yang K-W (2009) Multi-objective flexible job shop schedule: design and evaluation by simulation modeling. Appl Soft Comput 9: 362–376

    Article  Google Scholar 

  44. Yang J-H, Sun L, Lee HP, Qian Y, Liang Y-C (2008) Clonal selection based memetic algorithm for job shop scheduling problems. J Bionic Eng 5(2): 111–119

    Article  Google Scholar 

  45. Zhang G, Gao L, Shi Y (2011) An effective genetic algorithm for the flexible job-shop scheduling problem. Exp Syst Appl 38(4): 3563–3573

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Windsor, Windsor, ON, N9B-3P4, Canada

    Mohammad R. Raeesi N. & Ziad Kobti

Authors
  1. Mohammad R. Raeesi N.
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ziad Kobti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohammad R. Raeesi N..

Rights and permissions

Reprints and permissions

About this article

Cite this article

Raeesi N., M.R., Kobti, Z. A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic. Memetic Comp. 4, 231–245 (2012). https://doi.org/10.1007/s12293-012-0084-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12293-012-0084-0

Keywords

Search

Navigation