An efficient job shop scheduling algorithm based on artificial bee colony

The job shop scheduling problem (JSSP) is an NP-hard problem of wide engineering and theoretical background. In this paper, a discrete artificial bee colony based memetic algorithm, named DABC, is proposed for solving JSSP. Firstly, to make artificial bee colony (ABC) suitable for solving JSSP, we present a food source as a discrete job permutation and use the discrete operation to generate a new neighborhood food source for employing a bee colony, an onlooker bee colony and a scout bee colony. Secondly, three mutation operations are proposed to make DABC applicable for the job shop scheduling problem. Thirdly, the fast local search is used to enhance the individuals with a certain probability. Fourthly, the pairwise based local search is used to enhance the global optimal solution and help the algorithm to escape from the local minimum. Additionally, simulations and comparisons based on JSSP benchmarks are carried out, which show that our algorithm is both effective and efficient. Key words:

[1]  Yanchun Liang,et al.  An Effective PSO and AIS-Based Hybrid Intelligent Algorithm for Job-Shop Scheduling , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[2]  Ehl Emile Aarts,et al.  A computational study of constraint satisfaction for multiple capacitated job shop scheduling , 1996 .

[3]  L. Darrell Whitley,et al.  Problem difficulty for tabu search in job-shop scheduling , 2003, Artif. Intell..

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

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

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

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

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

[9]  KarabogaDervis,et al.  A powerful and efficient algorithm for numerical function optimization , 2007 .

[10]  Ali Allahverdi,et al.  New heuristics for no-wait flowshops to minimize makespan , 2003, Comput. Oper. Res..

[11]  Shengxiang Yang,et al.  A new adaptive neural network and heuristics hybrid approach for job-shop scheduling , 2001, Comput. Oper. Res..

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

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

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

[15]  V. P. Arunachalam,et al.  Improved solutions for job shop scheduling problems through genetic algorithm with a different method of schedule deduction , 2006 .

[16]  Robert H. Storer,et al.  Genetic Algorithms in Problem Space for Sequencing Problems , 1993 .

[17]  Dervis Karaboga,et al.  Fuzzy clustering with artificial bee colony algorithm , 2010 .

[18]  Ismail Hakki Cedimoglu,et al.  The strategies and parameters of tabu search for job-shop scheduling , 2004, J. Intell. Manuf..

[19]  Tingting Zou,et al.  Reverse Bridge Theorem under Constraint Partition , 2010 .

[20]  Shengxiang Yang,et al.  Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling , 2000, IEEE Trans. Neural Networks Learn. Syst..

[21]  Dervis Karaboga,et al.  A comparative study of Artificial Bee Colony algorithm , 2009, Appl. Math. Comput..

[22]  Pierre Borne,et al.  A controlled genetic algorithm by fuzzy logic and belief functions for job-shop scheduling , 2000, IEEE Trans. Syst. Man Cybern. Part B.

[23]  Ling Wang,et al.  A Modified Genetic Algorithm for Job Shop Scheduling , 2002 .

[24]  Shi-Jinn Horng,et al.  An efficient job-shop scheduling algorithm based on particle swarm optimization , 2010, Expert Syst. Appl..

[25]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

[26]  M OmbukiBeatrice,et al.  Local Search Genetic Algorithms for the Job Shop Scheduling Problem , 2004 .

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

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

[29]  Chinyao Low,et al.  A robust simulated annealing heuristic for flow shop scheduling problems , 2004 .

[30]  Hartmut Stadtler,et al.  Supply chain management and advanced planning--basics, overview and challenges , 2005, Eur. J. Oper. Res..

[31]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

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

[33]  Jun Zhang,et al.  Implementation of an Ant Colony Optimization technique for job shop scheduling problem , 2006 .

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

[35]  Ihsan Sabuncuoglu,et al.  Job shop scheduling with beam search , 1999, Eur. J. Oper. Res..

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

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

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

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

[40]  Bin Jiao,et al.  A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan , 2006, Appl. Math. Comput..

[41]  Xu Gang,et al.  Deadlock-free scheduling strategy for automated production cell , 2003, Proceedings 2003 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM 2003).

[42]  P. Aravindan,et al.  A Tabu Search Algorithm for Job Shop Scheduling , 2000 .

[43]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

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

[45]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

[46]  Weijun Xia,et al.  A hybrid particle swarm optimization approach for the job-shop scheduling problem , 2006 .

[47]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..