A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times

In this work a genetic algorithm is presented for the unrelated parallel machine scheduling problem in which machine and job sequence dependent setup times are considered. The proposed genetic algorithm includes a fast local search and a local search enhanced crossover operator. Two versions of the algorithm are obtained after extensive calibrations using the Design of Experiments (DOE) approach. We review, evaluate and compare the proposed algorithm against the best methods known from the literature. We also develop a benchmark of small and large instances to carry out the computational experiments. After an exhaustive computational and statistical analysis we can conclude that the proposed method shows an excellent performance overcoming the rest of the evaluated methods in a comprehensive benchmark set of instances.

[1]  Rubén Ruiz,et al.  TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .

[2]  Hyun Joon Shin,et al.  Scheduling jobs on parallel machines: a restricted tabu search approach , 2003 .

[3]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[4]  Michel Gendreau,et al.  A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times , 2001, Eur. J. Oper. Res..

[5]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

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

[7]  Jeng-Fung Chen,et al.  Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints , 2006 .

[8]  Sigrid Knust,et al.  List scheduling in a parallel machine environment with precedence constraints and setup times , 2001, Oper. Res. Lett..

[9]  Yan Chen,et al.  Scheduling jobs on parallel machines with setup times and ready times , 2008, Comput. Ind. Eng..

[10]  John Lu,et al.  Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective , 2001 .

[11]  Purushothaman Damodaran,et al.  Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms , 2009 .

[12]  Vinícius Amaral Armentano,et al.  Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based GRASP approach , 2007, Eur. J. Oper. Res..

[13]  Lionel Amodeo,et al.  A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times , 2006 .

[14]  Rasaratnam Logendran,et al.  Scheduling unrelated parallel machines with sequence-dependent setups , 2007, Comput. Oper. Res..

[15]  F. Frank Chen,et al.  Unrelated parallel machine scheduling with setup times using simulated annealing , 2002 .

[16]  P. Pardalos,et al.  Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search , 2007 .

[17]  Rene Driessel,et al.  Scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times using variable neighborhood search , 2009, 2009 International Conference on Computers & Industrial Engineering.

[18]  Chinyao Low,et al.  Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines , 2005, Comput. Oper. Res..

[19]  Xueping Li,et al.  Restricted job completion time variance minimisation on identical parallel machines , 2009 .

[20]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[21]  Michel Gendreau,et al.  A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times , 1996 .

[22]  Rubén Ruiz,et al.  No-wait flowshop with separate setup times to minimize maximum lateness , 2007 .

[23]  Massimo Paolucci,et al.  Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach , 2007, Comput. Oper. Res..

[24]  Jae Kyung Shim,et al.  Scheduling Jobs on Parallel Machines with Sequence-Dependent Family Set-up Times , 2002 .

[25]  F. Frank Chen,et al.  Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective , 2003 .

[26]  Ronald G. Askin,et al.  Heuristic scheduling of parallel machines with sequence-dependent set-up times , 2001 .

[27]  Ghaith Rabadi,et al.  Heuristics for the Unrelated Parallel Machine Scheduling Problem with Setup Times , 2006, J. Intell. Manuf..

[28]  Andrew Wirth,et al.  Heuristic methods for the identical parallel machine flowtime problem with set-up times , 2005, Comput. Oper. Res..

[29]  Jeng-Fung Chen,et al.  Unrelated parallel machine scheduling with secondary resource constraints , 2005 .

[30]  Jeng-Fung Chen.  Minimization of maximum tardiness on unrelated parallel machines with process restrictions and setups , 2006 .

[31]  A. Guinet.  Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria , 1993 .