Memetic algorithms for solving job-shop scheduling problems
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.
KeywordsJob-shop scheduling Genetic algorithm Memetic algorithm Local search Priority rules
Unable to display preview. Download preview PDF.
- 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
- 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.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.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
- 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.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
- 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
- 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
- 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
- 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.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.Yamada T, Nakano R (1997) Job-shop scheduling. Genetic algorithms in engineering systems. Cambridge University Press, New York, pp 134–160Google Scholar