A genetic algorithm for job-shop scheduling with operators enhanced by weak Lamarckian evolution and search space narrowing
- 367 Downloads
The job-shop scheduling problem with operators is a very interesting problem that generalizes the classic job-shop problem in such a way that an operation must be algorithm to solve this problem considering makespan minimization. The genetic algorithm uses permutations with repetition to encode chromosomes and a schedule generation scheme, termed OG&T, as decoding algorithm. This combination guaranties that at least one of the chromosomes represents and optimal schedule and, at the samhat machines and operators are idle while an operation is available to be processed. To improve the quality of the schedules for large instances, we use Lamarckian evolution and modify the OG&T algorithm to further reduce the idle time of the machines and operators, in this case at the risk of leaving all optimal schedules out of the search space. We conducted a large experimental study showing that these improvements allow the genetic algorithm to reach high quality solutions in very short time, and so it is quite competitive with the current state-of-the-art methods.
KeywordsJob shop scheduling problem with operators Genetic algorithms Lamarckian evolution Schedule generation schemes
This work has been supported by the Spanish Ministry of Science and Innovation under research project MICINN-FEDER TIN2010-20976-C02-02 and by FICYT under Grant BP09105.
- González MA, Vela CR, Varela R (2008) A new hybrid genetic algorithm for the job shop scheduling problem with setup times. In: Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS-2008). AAAI Press, SidneyGoogle Scholar
- González Rodríguez I, Vela CR, Puente J, Varela R (2008) A new local search for the job shop problem with uncertain durations. In: Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS-2008). AAAI Press, SidneyGoogle Scholar
- Mattfeld DC (1995) Evolutionary search and the job shop investigations on genetic algorithms for production scheduling. Springer, BerlinGoogle Scholar
- Mencía C, Sierra MR, Varela R (2012) Depth-first heuristic search for the job shop scheduling problem. Ann Oper Res. doi: 10.1007/s10479-012-1296-x
- Mencía C, Sierra MR, Varela R (2013) Intensified iterative deepening A* with application to job shop scheduling. J Intell Manuf. doi: 10.1007/s10845-012-0726-6
- Sierra MR, Mencía C, Varela R (2013) Searching for optimal schedules to the job-shop problem with operators. Technical report. iScOp Research Group. University of Oviedo, OviedoGoogle Scholar