A hybrid single and dual population search procedure for the job shop scheduling problem

This paper presents a genetic algorithm and a scatter search procedure to solve the well-known job shop scheduling problem. In contrast to the single population search performed by the genetic algorithm, the scatter search algorithm splits the population of solutions in a diverse and high-quality set to exchange information between individuals in a controlled way. The extension from a single to a dual population, by taking problem specific characteristics into account, can be seen as a stimulator to add diversity in the search process. This has a positive influence on the important balance between intensification and diversification. Computational experiments verify the benefit of this diversity on the effectiveness of the meta-heuristic search process. Various algorithmic parameters from literature are embedded in both procedures and a detailed comparison is made. A set of standard instances is used to compare the different approaches and the best obtained results are benchmarked against heuristic solutions found in literature.

[1]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[2]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[3]  F. Pezzella,et al.  A genetic algorithm for the Flexible Job-shop Scheduling Problem , 2008, Comput. Oper. Res..

[4]  Liang Gao,et al.  An efficient memetic algorithm for solving the job shop scheduling problem , 2011, Comput. Ind. Eng..

[5]  Andrea Rossi,et al.  A hybrid heuristic to solve the parallel machines job-shop scheduling problem , 2009, Adv. Eng. Softw..

[6]  Philippe Lacomme,et al.  A memetic algorithm for the job-shop with time-lags , 2008, Comput. Oper. Res..

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

[8]  Felix T.S. Chan,et al.  The application of genetic algorithms to lot streaming in a job-shop scheduling problem , 2009 .

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

[10]  Haibin Yu,et al.  Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling , 2001 .

[11]  Francisco Herrera,et al.  Finding multiple solutions in job shop scheduling by niching genetic algorithms , 2003, J. Intell. Manuf..

[12]  Mitsuo Gen,et al.  A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem , 2005, Comput. Ind. Eng..

[13]  Larry J. Eshelman,et al.  Preventing Premature Convergence in Genetic Algorithms by Preventing Incest , 1991, ICGA.

[14]  Hong Zhou,et al.  The hybrid heuristic genetic algorithm for job shop scheduling , 2001 .

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

[16]  Congxin Li,et al.  Research on immune genetic algorithm for solving the job-shop scheduling problem , 2007 .

[17]  George Chryssolouris,et al.  Dynamic scheduling of manufacturing job shops using genetic algorithms , 2001, J. Intell. Manuf..

[18]  C. Bierwirth.  A generalized permutation approach to job shop scheduling with genetic algorithms , 1995 .

[19]  Emanuela Merelli,et al.  A tabu search method guided by shifting bottleneck for the job shop scheduling problem , 2000, Eur. J. Oper. Res..

[20]  Zhiming Wu,et al.  A Genetic Algorithm Approach to the Scheduling of FMSs with Multiple Routes , 2001 .

[21]  Peigen Li,et al.  An effective hybrid genetic algorithm for the job shop scheduling problem , 2008 .

[22]  Carlos A. Coello Coello,et al.  Use of an Artificial Immune System for Job Shop Scheduling , 2003, ICARIS.

[23]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[24]  Fred Glover,et al.  Genetic algorithms and scatter search: unsuspected potentials , 1994 .

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

[26]  Eugeniusz Nowicki,et al.  An Advanced Tabu Search Algorithm for the Job Shop Problem , 2005, J. Sched..

[27]  I. Moon,et al.  Genetic algorithms for job shop scheduling problems with alternative routings , 2008 .

[28]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

[29]  Latif Al-Hakim,et al.  An analogue genetic algorithm for solving job shop scheduling problems , 2001 .

[30]  D. Y. Sha,et al.  A hybrid particle swarm optimization for job shop scheduling problem , 2006, Comput. Ind. Eng..

[31]  Tung-Kuan Liu,et al.  An improved genetic algorithm for job-shop scheduling problems using Taguchi-based crossover , 2008 .

[32]  Emile H. L. Aarts,et al.  Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series) , 2007 .

[33]  Andrew Lim,et al.  Sexual Selection for Genetic Algorithms , 2003, Artificial Intelligence Review.

[34]  Ling Wang,et al.  Scheduling multi-objective job shops using a memetic algorithm based on differential evolution , 2008 .

[35]  Beatrice M. Ombuki-Berman,et al.  Local Search Genetic Algorithms for the Job Shop Scheduling Problem , 2004, Applied Intelligence.

[36]  Carolina Salto,et al.  Enhanced evolutionary algorithms for single and multiobjective optimization in the job shop scheduling problem , 2002, Knowl. Based Syst..

[37]  A. Sadegheih.  Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance , 2006 .

[38]  Peigen Li,et al.  A very fast TS/SA algorithm for the job shop scheduling problem , 2008, Comput. Oper. Res..

[39]  Jean-Charles Billaut,et al.  A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem , 2008, Eur. J. Oper. Res..

[40]  L. Fu,et al.  A rule-centric memetic algorithm to minimize the number of tardy jobs in the job shop , 2008 .

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

[42]  Hong Zhou,et al.  Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times , 2001, Ann. Oper. Res..

[43]  Christian Bierwirth,et al.  On Permutation Representations for Scheduling Problems , 1996, PPSN.

[44]  Michael Kolonko,et al.  Some new results on simulated annealing applied to the job shop scheduling problem , 1999, Eur. J. Oper. Res..

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

[46]  Mitsuo Gen,et al.  Multistage-Based Genetic Algorithm for Flexible Job-Shop Scheduling Problem , 2009 .

[47]  L. Darrell Whitley,et al.  A Comparison of Genetic Algorithms for the Static Job Shop Scheduling Problem , 2000, PPSN.

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

[49]  Mohammad Mahdi Nasiri,et al.  A hybrid scatter search for the partial job shop scheduling problem , 2011 .

[50]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[51]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[52]  Mitsuo Gen,et al.  Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm , 2006, J. Intell. Manuf..

[53]  M. Chandrasekaran,et al.  Solving job shop scheduling problems using artificial immune system , 2006 .

[54]  Alberto Gómez,et al.  A knowledge-based evolutionary strategy for scheduling problems with bottlenecks , 2003, Eur. J. Oper. Res..

[55]  Reha Uzsoy,et al.  A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems , 1997, J. Heuristics.

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

[57]  Fred W. Glover,et al.  Principles of scatter search , 2006, Eur. J. Oper. Res..

[58]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[59]  Yazid Mati,et al.  A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem , 2008, Comput. Oper. Res..

[60]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[61]  N. Jawahar,et al.  Scheduling job shop associated with multiple routings with genetic and ant colony heuristics , 2009 .

[62]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[63]  Takeshi Yamada,et al.  Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.

[64]  Mehmet Emin Aydin,et al.  A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems , 2006, EvoCOP.

[65]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[66]  Tung-Kuan Liu,et al.  Improved genetic algorithm for the job-shop scheduling problem , 2006 .

[67]  Yih-Long Chang,et al.  A scatter search approach to sequence-dependent setup times job shop scheduling , 2009 .

[68]  Hyung Rim Choi,et al.  A hybrid genetic algorithm for the job shop scheduling problems , 2003, Comput. Ind. Eng..

[69]  Mitsuo Gen,et al.  A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems , 2007, Comput. Ind. Eng..

[70]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[71]  Ferdinando Pezzella,et al.  An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem , 2010, Eur. J. Oper. Res..

[72]  Wu Zhiming,et al.  Genetic algorithm approach to job shop scheduling and its use in real-time cases , 2000 .

[73]  Fred W. Glover,et al.  A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.

[74]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

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

[76]  Jimmy Ho-Man Lee,et al.  A constraint-based nurse rostering system using a redundant modeling approach , 1996, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence.

[77]  Jason Chao-Hsien Pan,et al.  A hybrid genetic algorithm for no-wait job shop scheduling problems , 2009, Expert Syst. Appl..

[78]  J. U. Sun,et al.  A genetic algorithm for a re-entrant job-shop scheduling problem with sequence-dependent setup times , 2009 .

[79]  Yih-Long Chang,et al.  Multi-criteria sequence-dependent job shop scheduling using genetic algorithms , 2009, Comput. Ind. Eng..

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

[81]  Mario Vanhoucke,et al.  Applying a hybrid job shop procedure to a Belgian manufacturing company producing industrial wheels and castors in rubber , 2011, Comput. Ind. Eng..