An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems

As a typical NP-hard combinatorial optimization problem, the hybrid flow shop (HFS) problem is widely existing in manufacturing systems. In this article, the HFS problem is modeled by vector representation, and then an improved discrete artificial bee colony (IDABC) algorithm is proposed for this problem to minimize the makespan. The proposed IDABC algorithm combines a novel differential evolution and a modified variable neighborhood search to generate new solutions for the employed and onlooker bees, and the destruction and construction procedures are used to obtain solutions for the scout bees. Moreover, an orthogonal test is applied to efficiently configure the system parameters, after a small number of training trials. The simulation results demonstrate that the proposed IDABC algorithm is effective and efficient comparing with several state-of-the-art algorithms on the same benchmark instances.

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

[2]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[3]  Orhan Engin,et al.  Using ant colony optimization to solve hybrid flow shop scheduling problems , 2007 .

[4]  Quan-Ke Pan,et al.  An improved artificial bee colony algorithm for the blocking flowshop scheduling problem , 2012 .

[5]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[6]  Rubén Ruiz,et al.  Modeling realistic hybrid flexible flowshop scheduling problems , 2008, Comput. Oper. Res..

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

[8]  Imma Ribas,et al.  An iterated greedy algorithm for the flowshop scheduling problem with blocking , 2011 .

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

[10]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

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

[12]  Yahya Fathi,et al.  Abstract Discrete Optimization , 2000 .

[13]  Ceyda Oguz,et al.  Hybrid flow-shop scheduling problems with multiprocessor task systems , 2004, Eur. J. Oper. Res..

[14]  Quan-Ke Pan,et al.  Discrete artificial bee colony algorithm for lot-streaming flowshop with total flowtime minimization , 2012, Chinese Journal of Mechanical Engineering.

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

[16]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[17]  D. Santos,et al.  Global lower bounds for flow shops with multiple processors , 1995 .

[18]  Xingsheng Gu,et al.  A discrete artificial bee colony algorithm for the blocking flow shop scheduling problem , 2012, Proceedings of the 10th World Congress on Intelligent Control and Automation.

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

[20]  Alper Döyen,et al.  A new approach to solve hybrid flow shop scheduling problems by artificial immune system , 2004, Future Gener. Comput. Syst..

[21]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[22]  Derviş Karaboğa,et al.  NEURAL NETWORKS TRAINING BY ARTIFICIAL BEE COLONY ALGORITHM ON PATTERN CLASSIFICATION , 2009 .

[23]  Min Liu,et al.  An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling , 2012 .

[24]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[25]  Philippe Baptiste,et al.  Solving hybrid flow shop problem using energetic reasoning and global operations , 2001 .

[26]  Dervis Karaboga,et al.  Parameter Tuning for the Artificial Bee Colony Algorithm , 2009, ICCCI.

[27]  Wei-Chang Yeh,et al.  Solving reliability redundancy allocation problems using an artificial bee colony algorithm , 2011, Comput. Oper. Res..

[28]  Cengiz Kahraman,et al.  An Application Of Effective Genetic Algorithms For Solving Hybrid Flow Shop Scheduling Problems , 2008, Int. J. Comput. Intell. Syst..

[29]  Shih-Wei Lin,et al.  Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic , 2009 .

[30]  Jacques Carlier,et al.  An Exact Method for Solving the Multi-Processor Flow-Shop , 2000, RAIRO Oper. Res..

[31]  J. C. Bean,et al.  A GENETIC ALGORITHM METHODOLOGY FOR COMPLEX SCHEDULING PROBLEMS , 1999 .

[32]  Quan-Ke Pan,et al.  An Effective Artificial Bee Colony Algorithm for a Real-World Hybrid Flowshop Problem in Steelmaking Process , 2013, IEEE Transactions on Automation Science and Engineering.

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

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

[35]  David E. Goldberg,et al.  AllelesLociand the Traveling Salesman Problem , 1985, ICGA.

[36]  J. N. D. Gupta,et al.  Minimizing tardy jobs in a two-stage hybrid flowshop , 1998 .

[37]  Ceyda Oguz,et al.  A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks , 2005, J. Sched..

[38]  Jose M. Framiñan,et al.  Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective , 2010, Comput. Oper. Res..

[39]  Rubén Ruiz,et al.  The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[40]  Dervis Karaboga,et al.  Artificial bee colony algorithm for large-scale problems and engineering design optimization , 2012, J. Intell. Manuf..

[41]  Yan-Feng Liu,et al.  A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem , 2013, Appl. Soft Comput..

[42]  Ching-Jong Liao,et al.  An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem , 2012, Appl. Soft Comput..

[43]  Shaukat A. Brah,et al.  Heuristics for scheduling in a flow shop with multiple processors , 1999, Eur. J. Oper. Res..

[44]  Dervis Karaboga,et al.  A novel clustering approach: Artificial Bee Colony (ABC) algorithm , 2011, Appl. Soft Comput..

[45]  Shiwei Ma,et al.  A Quantum-Inspired Immune Algorithm for Hybrid Flow Shop with Makespan Criterion , 2009 .

[46]  Jan Karel Lenstra,et al.  PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .

[47]  Rubén Ruiz,et al.  A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility , 2006, European Journal of Operational Research.