A genetic algorithm for job-shop scheduling with operators enhanced by weak Lamarckian evolution and search space narrowing

作者：Mencia Raul; Sierra Maria R^*; Mencia Carlos; Varela Ramiro

来源：Natural Computing, 2014, 13(2): 179-192.

DOI：10.1007/s11047-013-9373-x

• Job shop scheduling problem with operators
• Genetic algorithms
• Lamarckian evolution
• Schedule generation schemes

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.

• 出版日期2014-6