An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem

Hybrid flow shops (HFS) are common manufacturing environments in many industries, such as the glass, steel, paper and textile industries. In this paper, we present a particle swarm optimization (PSO) algorithm for the HFS scheduling problem with minimum makespan objective. The main contribution of this paper is to develop a new approach hybridizing PSO with bottleneck heuristic to fully exploit the bottleneck stage, and with simulated annealing to help escape from local optima. The proposed PSO algorithm is tested on the benchmark problems provided by Carlier and Neron. Experimental results show that the proposed algorithm outperforms all the compared algorithms in solving the HFS problem.

[1]  Mohammed El-Abd,et al.  Discrete cooperative particle swarm optimization for FPGA placement , 2010, Appl. Soft Comput..

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

[3]  M. Clerc,et al.  Particle Swarm Optimization , 2006 .

[4]  Mostafa Zandieh,et al.  A Tabu Search Approach to Hybrid Flow Shops Scheduling with Sequence-Dependent Setup Times , 2009 .

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

[6]  Abdelaziz Hamzaoui,et al.  An integrated ant colony optimization algorithm for the hybrid flow shop scheduling problem , 2009, 2009 International Conference on Computers & Industrial Engineering.

[7]  Ceyda Oguz,et al.  Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion , 2007 .

[8]  Mohammad Reza Amin-Naseri,et al.  Hybrid flow shop scheduling with parallel batching , 2009 .

[9]  Cengiz Kahraman,et al.  Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach , 2010, Appl. Soft Comput..

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

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

[12]  Abdelhakim Artiba,et al.  A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan , 1998, Eur. J. Oper. Res..

[13]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

[14]  Marie-Claude Portmann,et al.  Branch and bound crossed with GA to solve hybrid flowshops , 1998, Eur. J. Oper. Res..

[15]  M R Amin Naseri,et al.  HYBRID FLOW SHOP SCHEDULING WITH PARALLEL BATCHING , 2009 .

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

[17]  Orhan Engin,et al.  An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems , 2011, Appl. Soft Comput..

[18]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[19]  Ling Wang,et al.  An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers , 2008, Comput. Oper. Res..

[20]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[21]  D. Y. Sha,et al.  A new particle swarm optimization for the open shop scheduling problem , 2008, Comput. Oper. Res..

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

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

[24]  Roger E. Kirk,et al.  Statistics: An Introduction , 1998 .

[25]  Andries Petrus Engelbrecht,et al.  Fundamentals of Computational Swarm Intelligence , 2005 .

[26]  J. Gupta,et al.  Scheduling a two-stage hybrid flowshop with separable setup and removal times , 1994 .

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

[28]  Ching-Jong Liao,et al.  A case study in a two-stage hybrid flow shop with setup time and dedicated machines , 2003 .

[29]  Jianmei Xiao,et al.  PSO-Based Model Predictive Control for Nonlinear Processes , 2005, ICNC.

[30]  Pin Luarn,et al.  A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..

[31]  Jairo R. Montoya-Torres,et al.  Scheduling jobs on a k-stage flexible flow-shop , 2004, Proceedings of the 2004 IEEE Systems and Information Engineering Design Symposium, 2004..

[32]  J. Teghem,et al.  Using Genetic Algorithm in the Multiprocessor Flow Shop to Minimize the Makespan , 2006, 2006 International Conference on Service Systems and Service Management.

[33]  Patrick Siarry,et al.  A theoretical study on the behavior of simulated annealing leading to a new cooling schedule , 2005, Eur. J. Oper. Res..

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

[35]  Magdalene Marinaki,et al.  A Hybrid Multi-Swarm Particle Swarm Optimization algorithm for the Probabilistic Traveling Salesman Problem , 2010, Comput. Oper. Res..

[36]  Mehdi Heydari,et al.  A HEURISTIC ALGORITHM FOR HYBRID FLOW-SHOP PRODUCTION SCHEDULING TO MINIMIZE THE SUM OF THE EARLINESS ANDF TARDINESS COSTS , 2008 .

[37]  Quan-Ke Pan,et al.  A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems , 2009, Comput. Oper. Res..