A hybrid evolutionary algorithm for the job shop scheduling problem

In this paper, a hybrid metaheuristic method for the job shop scheduling problem is proposed. The optimization criterion is the minimization of makespan and the solution method consists of three components: a Differential Evolution-based algorithm to generate a population of initial solutions, a Variable Neighbourhood Search method and a Genetic Algorithm to improve the population; the latter two are interconnected. Computational experiments on benchmark data sets demonstrate that the proposed hybrid metaheuristic reaches high quality solutions in short computational times using fixed parameter settings.

[1]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

[2]  J. Dongarra.  Performance of various computers using standard linear equations software , 1990, CARN.

[3]  Krzysztof Fleszar,et al.  An effective heuristic for the CLSP with set-up times , 2003, J. Oper. Res. Soc..

[4]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[5]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

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

[7]  Andreas C. Nearchou,et al.  A differential evolution approach for the common due date early/tardy job scheduling problem , 2008, Comput. Oper. Res..

[8]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..

[9]  Takeshi Yamada,et al.  A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems , 1992, PPSN.

[10]  Paul M. E. Shutler,et al.  A priority list based heuristic for the job shop problem: part 2 tabu search , 2004, J. Oper. Res. Soc..

[11]  Gu Qingming,et al.  A HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEDULING PROBLEM , 1998 .

[12]  Krzysztof Fleszar,et al.  Solving the resource-constrained project scheduling problem by a variable neighbourhood search , 2004, Eur. J. Oper. Res..

[13]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[14]  Vassilios S. Vassiliadis,et al.  A novel threshold accepting meta-heuristic for the job-shop scheduling problem , 2004, Comput. Oper. Res..

[15]  Saeed Zolfaghari,et al.  A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling , 2007, Eur. J. Oper. Res..

[16]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[17]  Ling Wang,et al.  An effective hybrid optimization strategy for job-shop scheduling problems , 2001, Comput. Oper. Res..

[18]  Marc Gravel,et al.  Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems , 2005, J. Oper. Res. Soc..

[19]  Paul M. E. Shutler.  A priority list based heuristic for the job shop problem , 2003, J. Oper. Res. Soc..

[20]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[21]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[22]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[23]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[24]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[25]  C. D. Tarantilis,et al.  A list-based threshold accepting method for job shop scheduling problems , 2002 .

[26]  Christos D. Tarantilis,et al.  A modern local search method for operations scheduling of dehydration plants , 2002 .

[27]  Ching-Jong Liao,et al.  Ant colony optimization combined with taboo search for the job shop scheduling problem , 2008, Comput. Oper. Res..

[28]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

[29]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[30]  John M. Wilson,et al.  A genetic algorithm for flow shop scheduling problems , 2004, J. Oper. Res. Soc..

[31]  J. K. Lenstra,et al.  Computational complexity of discrete optimization problems , 1977 .

[32]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

[33]  Peigen Li,et al.  A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem , 2007, Comput. Oper. Res..

[34]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[35]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

[36]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[37]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[38]  Frederick E. Petry,et al.  Principles and Applications , 1997 .

[39]  Anders Bjerg Pedersen,et al.  A Fast Taboo Search Algorithm for the Job Shop Scheduling Problem , 2008 .

[40]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[41]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..