Memetic Computing

, Volume 1, Issue 1, pp 69–83 | Cite as

Memetic algorithms for solving job-shop scheduling problems

  • S. M. Kamrul HasanEmail author
  • Ruhul Sarker
  • Daryl Essam
  • David Cornforth
Regular Research Paper


The job-shop scheduling problem is well known for its complexity as an NP-hard problem. We have considered JSSPs with an objective of minimizing makespan while satisfying a number of hard constraints. In this paper, we developed a memetic algorithm (MA) for solving JSSPs. Three priority rules were designed, namely partial re-ordering, gap reduction and restricted swapping, and used as local search techniques in our MA. We have solved 40 benchmark problems and compared the results obtained with a number of established algorithms in the literature. The experimental results show that MA, as compared to GA, not only improves the quality of solutions but also reduces the overall computational time.


Job-shop scheduling Genetic algorithm Memetic algorithm Local search Priority rules 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aarts EHL, Van Laarhoven PJM, Lenstra JK, Ulder NLJ (1994) A computational study of local search algorithms for job shop scheduling. ORSA J Comput 6: 118–125zbMATHGoogle Scholar
  2. 2.
    Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manage Sci 34: 391–401zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Biegel JE, Davern JJ (1990) Genetic algorithms and job shop scheduling. Comput Ind Eng 19: 81–91CrossRefGoogle Scholar
  4. 4.
    Binato S, Hery WJ, Loewenstern DM, Resende MGC (2001) A GRASP for job shop scheduling. Essays and surveys on metaheuristics. Kluwer Academic Publishers, Boston, MA, pp 58–79Google Scholar
  5. 5.
    Croce FD, Tadei R, Volta G (1995) A genetic algorithm for the job shop problem. Comput Oper Res 22: 15–24zbMATHCrossRefGoogle Scholar
  6. 6.
    Dorndorf U, Pesch E (1995) Evolution based learning in a job shop scheduling environment. Comput Oper Res 22: 25–40zbMATHCrossRefGoogle Scholar
  7. 7.
    Garey MR, Johnson DS (1979) Computers and intractability : a guide to the theory of NP-completeness. W. H. Freeman, San FranciscozbMATHGoogle Scholar
  8. 8.
    Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1: 117–129zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Pub. Co., Reading, MAzbMATHGoogle Scholar
  10. 10.
    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–1920Google Scholar
  11. 11.
    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–524Google Scholar
  12. 12.
    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–3811Google Scholar
  13. 13.
    Ishibuchi H, Murata T (1998) A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans Syst Man Cybernet Part C 28: 392–403CrossRefGoogle Scholar
  14. 14.
    Lawrence D (1985) Job shop scheduling with genetic algorithms. In: First international conference on genetic algorithms, Mahwah, New Jersey, pp 136–140Google Scholar
  15. 15.
    Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PennsylvaniaGoogle Scholar
  16. 16.
    Lenstra JK, Rinnooy Kan AHG (1979) Computational complexity of discrete optimization problems. Ann Discrete Math 4: 121–140zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Nakano R, Yamada T (1991) Conventional genetic algorithm for job shop problems. In: Fourth international conference on genetic algorithms, Morgan Kaufmann, San Mateo, CA, pp 474–479Google Scholar
  18. 18.
    Ombuki BM, Ventresca M (2004) Local search genetic algorithms for the job shop scheduling problem. Appl Intell 21: 99–109zbMATHCrossRefGoogle Scholar
  19. 19.
    Ong YS, Keane AJ (2004) Meta-Lamarckian learning in memetic algorithms. IEEE Trans Evol Comput 8: 99–110CrossRefGoogle Scholar
  20. 20.
    Paredis J (1997) Exploiting constraints as background knowledge for evolutionary algorithms. Handbook of evolutionary computation. Institute of Physics Publishing and Oxford University Press, Bristol, New York, G1.2:1–6Google Scholar
  21. 21.
    Park BJ, Choi HR, Kim HS (2003) A hybrid genetic algorithm for the job shop scheduling problems. Comput Ind Eng 45: 597–613CrossRefGoogle Scholar
  22. 22.
    Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res 35: 3202–3212zbMATHCrossRefGoogle Scholar
  23. 23.
    Ponnambalam SG, Aravindan P, Rao PS (2001) Comparative evaluation of genetic algorithms for job-shop scheduling. Prod Plan Control 12: 560–674CrossRefGoogle Scholar
  24. 24.
    Shigenob K, Isao O, Masayuki Y (1995) An efficient genetic algorithm for job shop scheduling problems. In: 6th International conference on genetic algorithms, Pittsburgh, PA, pp 506–511Google Scholar
  25. 25.
    Wang W, Brunn P (2000) An effective genetic algorithm for job shop scheduling. Proc Inst Mech Eng Part B: J Eng Manuf 214: 293–300CrossRefGoogle Scholar
  26. 26.
    Yamada T (2003) Studies on metaheuristics for jobshop and flowshop scheduling problems. Doctor of Informatics, Department of Applied Mathematics and Physics. Kyoto University, Kyoto, JapanGoogle Scholar
  27. 27.
    Yamada T, Nakano R (1997) Genetic algorithms for job-shop scheduling problems. Modern Heuristic for Decision Support. UNICOM seminar, London, pp 67–81Google Scholar
  28. 28.
    Yamada T, Nakano R (1997) Job-shop scheduling. Genetic algorithms in engineering systems. Cambridge University Press, New York, pp 134–160Google Scholar

Copyright information

© Springer-Verlag 2008

Authors and Affiliations

  • S. M. Kamrul Hasan
    • 1
    Email author
  • Ruhul Sarker
    • 1
  • Daryl Essam
    • 1
  • David Cornforth
    • 1
  1. 1.School of Information Technology and Electrical EngineeringUniversity of New South Wales at the Australian Defence Force AcademyCanberraAustralia

Personalised recommendations