论文信息 - A hybrid genetic algorithm with local search approach for E/T scheduling problems on identical parallel machines

A hybrid genetic algorithm with local search approach for E/T scheduling problems on identical parallel machines

This work considers scheduling problems on single and parallel machines with arbitrary processing times and independent jobs, to minimize the sum of earliness-tardiness penalties. A Genetic Algorithm with a smart local search approach is presented, a 2-opt neighborhood-based with GPI moves and tie-breaking criteria, in a single sequence representation for single and multi-machine instances. Computational experiments are performed on Tanaka's instances for single machine, achieving all optimal solutions obtained by an IP exact method, for 40, 50, and 100 jobs. Moreover, our method is also suitable for dealing with multi-machine instances, achieving good solutions in a reasonable execution time, for 40, 50, and 100 jobs, with 2, 4, and 10 machines.

[1] Shunji Tanaka,et al. An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem , 2012 .

[2] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .

[3] Srini Ramaswamy,et al. A Genetic Algorithm for Single Machine Total Weighted Tardiness Scheduling Problem , 2005 .

[4] Marcus Poggi de Aragão,et al. Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems , 2010, Math. Program. Comput..