A Swarm Intelligence Approach to Flexible Job-Shop Scheduling Problem with No-Wait Constraint in Remanufacturing

This paper addresses a flexible job-shop scheduling problem with no-wait constraint (FJSPNW) which combines features of two well-known combinatorial optimization problems – flexible job-shop scheduling problem and no-wait job-shop scheduling problem. To solve FJSPNW with the objective of minimizing the makespan, an artificial bee colony (ABC) algorithm is proposed. This problem finds application in remanufacturing scheduling systems. ABC algorithm is a recently developed swarm intelligence technique based on intelligent foraging behavior of honey bee swarm. Since its inception, it has shown promising performance for the solution of numerous hard optimization problems. Numerical experiments have been performed on a set of standard benchmark instances in order to demonstrate the effectiveness of ABC algorithm.

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

[2]  Luca Maria Gambardella,et al.  Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .

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

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

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

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

[7]  Alok Singh,et al.  A swarm intelligence approach to the quadratic minimum spanning tree problem , 2010, Inf. Sci..

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

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

[10]  Peter Schlattmann,et al.  Theory and Algorithms , 2009 .

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

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

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

[14]  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).

[15]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. 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]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[18]  Peter Brucker,et al.  Job-shop scheduling with multi-purpose machines , 1991, Computing.

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