Minimizing makespan in multi-factory flow shop problem using a chemical reaction metaheuristic

Solving scheduling problems is an important branch of operational research field. It consists in allocation number of jobs to machines taking into consideration a set of constraints. Recently, a new generalization of the permutation flow shop scheduling problem with multi-factory environment has been proposed. In this work, we suggest to apply a Chemical Reaction Optimization (CRO) metaheuristic to solve this problem in order to minimize makespan or the total duration of the schedule. An experimental study is carried out in order to analyze the performance of the proposed algorithm and to compare it with powerful algorithms on standard benchmarks.

[1]  Mohamed Jemni,et al.  Solving the Permutation Flow Shop Problem with Makespan Criterion using Grids , 2011 .

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Jian Gao,et al.  An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem , 2013 .

[4]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[5]  Quan-Ke Pan,et al.  Chemical-reaction optimization for flexible job-shop scheduling problems with maintenance activity , 2012, Appl. Soft Comput..

[6]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[7]  Rong Chen,et al.  A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem , 2011, Int. J. Comput. Intell. Syst..

[8]  Felix T.S. Chan,et al.  A hybrid genetic algorithm for production and distribution , 2005 .

[9]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[10]  Harvey M. Wagner,et al.  An integer linear‐programming model for machine scheduling , 1959 .

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

[12]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[13]  Shih-Wei Lin,et al.  Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm , 2013 .

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

[15]  Sai Ho Chung,et al.  An adaptive genetic algorithm with dominated genes for distributed scheduling problems , 2005, Expert Syst. Appl..

[16]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[17]  Victor O. K. Li,et al.  Chemical-Reaction-Inspired Metaheuristic for Optimization , 2010, IEEE Transactions on Evolutionary Computation.

[18]  Olfa Belkahla Driss,et al.  Multi-agent Model Based on Tabu Search for the Permutation Flow Shop Scheduling Problem , 2014, DCAI.

[19]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[20]  Rubén Ruiz,et al.  The distributed permutation flowshop scheduling problem , 2010, Comput. Oper. Res..

[21]  Jin Xu,et al.  Parallel Chemical Reaction Optimization for the Quadratic Assignment Problem , 2010, GEM.

[22]  J. Framiñan,et al.  A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem , 2015 .

[23]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .