A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem

This article addresses the distributed two-stage assembly flow-shop scheduling problem (DTSAFSP) with makespan minimisation criterion. A mixed integer linear programming model is presented, and a competitive memetic algorithm (CMA) is proposed. When designing the CMA, a simple encoding scheme is proposed to represent the factory assignment and the job processing sequence; and a ring-based neighbourhood structure is designed for competition and information sharing. Moreover, some knowledge-based local search operators are developed to enhance the exploitation ability. The influence of parameter setting on the CMA is investigated using the analysis of variance method. Extensive computational tests and comparisons are carried out, which demonstrate the effectiveness of the proposed CMA in solving the DTSAFSP.

[1]  Fawaz S. Al-Anzi,et al.  A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application , 2006, Comput. Oper. Res..

[2]  Ching-Jong Liao,et al.  A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks , 2008 .

[3]  Yew-Soon Ong,et al.  Memetic Computation—Past, Present & Future [Research Frontier] , 2010, IEEE Computational Intelligence Magazine.

[4]  Sun Hur,et al.  Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain , 2002 .

[5]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[6]  Kay Chen Tan,et al.  A Multi-Facet Survey on Memetic Computation , 2011, IEEE Transactions on Evolutionary Computation.

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

[8]  E. Shokrollahpour,et al.  A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem , 2011 .

[9]  Ling Wang,et al.  An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem , 2013 .

[10]  Chung-Yee Lee,et al.  Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem , 1993 .

[11]  Ying Liu,et al.  A unified framework for population-based metaheuristics , 2011, Ann. Oper. Res..

[12]  Yew-Soon Ong,et al.  A Probabilistic Memetic Framework , 2009, IEEE Transactions on Evolutionary Computation.

[13]  Ali Tozkapan,et al.  A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem , 2003, Comput. Oper. Res..

[14]  Keyi Xing,et al.  Meta-heuristics for the distributed two-stage assembly scheduling problem with bi-criteria of makespan and mean completion time , 2014 .

[15]  Hong-Sen Yan,et al.  A hybrid electromagnetism-like algorithm for two-stage assembly flow shop scheduling problem , 2014 .

[16]  F. Jolai,et al.  Two-stage assembly flow-shop scheduling problem with non-identical assembly machines considering setup times , 2013 .

[17]  Hang Lei,et al.  Minimizing the total completion time in a distributed two stage assembly system with setup times , 2014, Comput. Oper. Res..

[18]  Fawaz S. Al-Anzi,et al.  Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times , 2006 .

[19]  Fawaz S. Al-Anzi,et al.  A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times , 2007, Eur. J. Oper. Res..

[20]  A. Azab,et al.  Modeling and heuristics for scheduling of distributed job shops , 2014, Expert Syst. Appl..

[21]  Ali Azadeh,et al.  An integrated neural network–simulation algorithm for performance optimisation of the bi-criteria two-stage assembly flow-shop scheduling problem with stochastic activities , 2012 .

[22]  Ali Allahverdi,et al.  The two stage assembly flowshop scheduling problem to minimize total tardiness , 2012, J. Intell. Manuf..

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

[24]  Javad Behnamian,et al.  Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation , 2014, Comput. Oper. Res..

[25]  P. Shahabudeen,et al.  An improved genetic algorithm for the flowshop scheduling problem , 2009 .

[26]  Felix T.S. Chan,et al.  Application of genetic algorithms with dominant genes in a distributed scheduling problem in flexible manufacturing systems , 2006 .

[27]  Chris N. Potts,et al.  The Two-Stage Assembly Scheduling Problem: Complexity and Approximation , 1995, Oper. Res..

[28]  Morteza Kiani,et al.  An efficient imperialist competitive algorithm for scheduling in the two-stage assembly flow shop problem , 2014 .

[29]  Sara Hatami,et al.  The Distributed Assembly Permutation Flowshop Scheduling Problem , 2013 .

[30]  Ali Allahverdi,et al.  Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan , 2009, Comput. Oper. Res..