Integrating Genetic Algorithm, Tabu Search and Simulated Annealing For Job Shop Scheduling Proble

Job Shop Scheduling Problem (JSSP) is an optimization problem in which ideal jobs are assigned to resources at particular times. In recent years many attempts have been made at the solution of JSSP using a various range of tools and techniques such as Branch and Bound and Heuristics algorithms. This paper proposed a new algorithm based on Genetic Algorithm (GA), Tabu Search (TS) and Simulated Annealing (SA) algorithms to solve JSSP. The proposed algorithm is mainly based on the genetic algorithm. The reproduction phase of the genetic algorithm uses the tabu search to generate new population. Simulated annealing algorithm is used to speed up the genetic algorithm to get the solution by applying the simulated annealing test for all the population members. The proposed algorithm used many small but important features such as chromosome representation, effective genetic operators, and restricted neighbourhood strategies. The above features are used in the hybrid algorithm to solve several bench mark problems.

[1]  Christian Artigues,et al.  A branch and bound method for the job-shop problem with sequence-dependent setup times , 2008, Ann. Oper. Res..

[2]  Marco Furini,et al.  International Journal of Computer and Applications , 2010 .

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

[4]  Mostafa Zandieh,et al.  Integrating simulation and genetic algorithm to schedule a dynamic flexible job shop , 2009, J. Intell. Manuf..

[5]  Ling Wang,et al.  An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers , 2008, Comput. Oper. Res..

[6]  J. Billaut,et al.  A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint , 2002, J. Oper. Res. Soc..

[7]  Francisco Herrera,et al.  Analysis of new niching genetic algorithms for finding multiple solutions in the job shop scheduling , 2012, J. Intell. Manuf..

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

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

[10]  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..

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

[12]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

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

[14]  Andrew Y. C. Nee,et al.  Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems , 2009 .

[15]  Chris N. Potts,et al.  Dynamic programming and decomposition approaches for the single machine total tardiness problem , 1987 .

[16]  Erwin Pesch,et al.  Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..

[17]  Imed Kacem,et al.  Genetic algorithm for the flexible job-shop scheduling problem , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[18]  P. Balasubramanie,et al.  Integration of Genetic Algorithm with Tabu Search for Job Shop Scheduling with Unordered Subsequence Exchange Crossover , 2012 .

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

[20]  Takeo Kanade,et al.  Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy , 2009 .

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

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

[23]  Camino R. Vela,et al.  Genetic Algorithm Combined with Tabu Search for the Job Shop Scheduling Problem with Setup Times , 2009, IWINAC.

[24]  Christian Bierwirth,et al.  Production Scheduling and Rescheduling with Genetic Algorithms , 1999, Evolutionary Computation.

[25]  Katsuhiko Takahashi,et al.  Simulated annealing approach for minimizing the makespan of the general job-shop , 1999 .

[26]  R. Suresh,et al.  Pareto archived simulated annealing for job shop scheduling with multiple objectives , 2006 .

[27]  D. Atkin OR scheduling algorithms. , 2000, Anesthesiology.

[28]  Lifeng Xi,et al.  A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal , 2007, Eur. J. Oper. Res..

[29]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[30]  Takeshi Yamada,et al.  Scheduling by Genetic Local Search with Multi-Step Crossover , 1996, PPSN.

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

[32]  Sheik Meeran,et al.  A multi-level hybrid framework applied to the general flow-shop scheduling problem , 2002, Comput. Oper. Res..

[33]  P. Balasubramanie,et al.  Analysis of Various Alternate Crossover Strategies for Genetic Algorithm to Solve Job Shop Scheduling Problems , 2011 .

[34]  Mehmet Emin Aydin,et al.  A simulated annealing algorithm for multi-agent systems: a job-shop scheduling application , 2004, J. Intell. Manuf..

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

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

[37]  Yang Shi,et al.  A Genetic Algorithm and Tabu Search for Multi Objective Flexible Job Shop Scheduling Problems , 2010, 2010 International Conference on Computing, Control and Industrial Engineering.

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

[39]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[40]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

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

[42]  Dirk C. Mattfeld,et al.  Evolutionary Search and the Job Shop - Investigations on Genetic Algorithms for Production Scheduling , 1996, Production and Logistics.

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

[44]  Tai-Yue Wang,et al.  A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems , 2000, Int. J. Syst. Sci..

[45]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[46]  A. Tamilarasi,et al.  Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems , 2009 .

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