A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint

This paper studies a hybrid artificial bee colony (ABC) algorithm for finding high quality solutions of the job-shop scheduling problem with no-wait constraint (JSPNW) with the objective of minimizing makespan among all the jobs. JSPNW is an extension of well-known job-shop scheduling problem subject to the constraint that no waiting time is allowed between operations for a given job. ABC algorithm is a swarm intelligence technique based on intelligent foraging behavior of honey bee swarm. The proposed hybrid approach effectively coordinates the various components of ABC algorithm such as solution initialization, selection and determination of a neighboring solution with the local search in such a way that it leads to high quality solutions for the JSPNW. The proposed approach is compared with the two best approaches in the literature on a set of benchmark instances. Computational results show the superiority of the proposed approach over these two best approaches.

[1]  Wojciech Bożejko,et al.  Solving the no-wait job-shop problem by using genetic algorithm with automatic adjustment , 2011 .

[2]  Chelliah Sriskandarajah,et al.  Some no-wait shops scheduling problems: Complexity aspect , 1986 .

[3]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops , 2011, Inf. Sci..

[4]  W. Kubiak A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem , 1989 .

[5]  Wojciech Bozejko,et al.  A fast hybrid tabu search algorithm for the no-wait job shop problem , 2009, Comput. Ind. Eng..

[6]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[7]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[8]  Sartaj Sahni,et al.  Complexity of Scheduling Shops with No Wait in Process , 1979, Math. Oper. Res..

[9]  R. Macchiaroli,et al.  Design and implementation of a tabu search algorithm to solve the no-wait job-shop scheduling problem , 1996 .

[10]  Daniel Kudenko,et al.  Tuning an Algorithm Using Design of Experiments , 2010, Experimental Methods for the Analysis of Optimization Algorithms.

[11]  Alok Singh,et al.  A Swarm Intelligence Approach to the Quadratic Multiple Knapsack Problem , 2010, ICONIP.

[12]  Dario Pacciarelli,et al.  Job-shop scheduling with blocking and no-wait constraints , 2002, Eur. J. Oper. Res..

[13]  Jose M. Framiñan,et al.  Approximative procedures for no-wait job shop scheduling , 2003, Oper. Res. Lett..

[14]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[15]  José Fernando Gonçalves,et al.  A Hybrid Genetic Algorithm for the Early/tardy Scheduling Problem , 2006, Asia Pac. J. Oper. Res..

[16]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem , 2011, Inf. Sci..

[17]  Xiaoping Li,et al.  An Effective Meta-Heuristic for No-Wait Job Shops to Minimize Makespan , 2012, IEEE Transactions on Automation Science and Engineering.

[18]  B. Roy,et al.  Les Problemes d'Ordonnancement , 1967 .

[19]  Czesław Smutnicki,et al.  Scheduling in Production of Concrete Wares , 1997 .

[20]  Carlos A. Brizuela,et al.  No-wait and blocking job-shops: challenging problems for GA's , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).

[21]  Jürgen Dorn,et al.  Scheduling High-Grade Steelmaking , 1996, IEEE Expert.

[22]  ALOK SINGH,et al.  A Hybrid Permutation-Coded Evolutionary Algorithm for the Early/tardy Scheduling Problem , 2010, Asia Pac. J. Oper. Res..

[23]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[24]  Mauro Birattari,et al.  Tuning Metaheuristics - A Machine Learning Perspective , 2009, Studies in Computational Intelligence.

[25]  Lixin Tang,et al.  A mathematical programming model for scheduling steelmaking-continuous casting production , 2000, Eur. J. Oper. Res..

[26]  Alok Singh,et al.  A swarm intelligence approach to the early/tardy scheduling problem , 2012, Swarm Evol. Comput..

[27]  Christoph J. Schuster No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems , 2006, Math. Methods Oper. Res..

[28]  Jose M. Framiñan,et al.  An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach , 2006, Comput. Oper. Res..

[29]  Dervis Karaboga,et al.  A comprehensive survey: artificial bee colony (ABC) algorithm and applications , 2012, Artificial Intelligence Review.

[30]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[31]  Alok Singh,et al.  An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem , 2009, Appl. Soft Comput..

[32]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

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

[34]  Chelliah Sriskandarajah,et al.  The complexity of scheduling jobs in repetitive manufacturing systems , 1993 .

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

[36]  Thomas Bartz-Beielstein,et al.  Experimental Methods for the Analysis of Optimization Algorithms , 2010 .

[37]  Xiaoping Li,et al.  Complete local search with limited memory algorithm for no-wait job shops to minimize makespan , 2009, Eur. J. Oper. Res..