Ant colony optimization combined with taboo search for the job shop scheduling problem

In this paper, we present a hybrid algorithm combining ant colony optimization algorithm with the taboo search algorithm for the classical job shop scheduling problem. Instead of using the conventional construction approach to construct feasible schedules, the proposed ant colony optimization algorithm employs a novel decomposition method inspired by the shifting bottleneck procedure, and a mechanism of occasional reoptimizations of partial schedules. Besides, a taboo search algorithm is embedded to improve the solution quality. We run the proposed algorithm on 101 benchmark instances and obtain competitive results and a new best upper bound for one open benchmark instance is found.

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

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

[3]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

[4]  Thom J. Hodgson,et al.  On solving the classic job shop makespan problem by minimizing Lmax , 2002 .

[5]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[6]  Peter Brucker,et al.  Job-shop Scheduling Problem , 2009, Encyclopedia of Optimization.

[7]  Mieczysław Wodecki,et al.  A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

[8]  Richard Bellman,et al.  The Job-shop Scheduling Problem , 1982 .

[9]  Matthijs den Besten,et al.  Ant Colony Optimization for the Total Weighted Tardiness Problem , 2000, PPSN.

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

[11]  S. Binato,et al.  A GRASP FOR JOB SHOP SCHEDULING , 2001 .

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

[13]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[14]  Stéphane Dauzère-Pérès,et al.  A modified shifting bottleneck procedure for job-shop scheduling , 1993 .

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

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

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

[18]  Nicolas Monmarché,et al.  An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem , 2002, Eur. J. Oper. Res..

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

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

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

[23]  Erwin Pesch,et al.  Constraint Propagation and Problem Decomposition: A Preprocessing Procedure for the Job Shop Problem , 2002, Ann. Oper. Res..

[24]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[25]  E. Balas,et al.  The one-machine problem with delayed precedence constraints and its use in job shop scheduling , 1995 .

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

[27]  Christian Blum,et al.  ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification , 2002, Ant Algorithms.

[28]  Michael Sampels,et al.  Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[29]  Takeshi Yamada,et al.  Job-Shop Scheduling by Simulated Annealing Combined with Deterministic Local Search , 1996 .

[30]  Christian Blum,et al.  An Ant Colony Optimization Algorithm for Shop Scheduling Problems , 2004, J. Math. Model. Algorithms.

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

[32]  Thomas Stützle,et al.  An Ant Approach to the Flow Shop Problem , 1998 .

[33]  Richard F. Hartl,et al.  An ant colony optimization approach for the single machine total tardiness problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[34]  Marc Gravel,et al.  Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times , 2002, J. Oper. Res. Soc..

[35]  I H Osman,et al.  Meta-Heuristics Theory and Applications , 2011 .

[36]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[37]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[38]  Ramesh Sharda,et al.  Metaheuristic Optimization via Memory and Evolution , 2005 .

[39]  Fred Glover,et al.  Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory , 1999, INFORMS J. Comput..

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

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

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

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

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

[45]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..