A hybrid electromagnetism-like algorithm for two-stage assembly flow shop scheduling problem

This paper presents a study on the two-stage assembly flow shop scheduling problem for minimising the weighed sum of maximum makespan, earliness and lateness. There are m machines at the first stage, each of which produces a component of a job. A single machine at the second stage assembles the m components together to complete the job. A novel model for solving the scheduling problem is built to optimise the maximum makespan, earliness and lateness simultaneously. Two optimal operation sequences of jobs are determined and verified. As the problem is known to be NP-hard, a hybrid variable neighbourhood search – electromagnetism-like mechanism (VNS-EM) algorithm is proposed for its handling. To search beyond local optima for a global one, VNS algorithm is embedded in each iteration of EM, whereby the fine neighbourhood search of optimum individuals can be realised and the solution is thus optimised. Simulation results show that the proposed hybrid VNS-EM algorithm outperforms the EM and VNS algorithms in both average value and standard deviation.

[1]  P. M. Khodke,et al.  Real-time scheduling in manufacturing system with machining and assembly operations: a state of art , 2013 .

[2]  Anton V. Eremeev,et al.  HBBA: hybrid algorithm for buffer allocation in tandem production lines , 2007, J. Intell. Manuf..

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

[4]  Hamid Davoudpour,et al.  Solving Flow Shop Sequencing Problem for Deteriorating Jobs by Using Electro Magnetic Algorithm , 2008 .

[5]  Alberto García-Villoria,et al.  Solving the response time variability problem by means of the electromagnetism-like mechanism , 2010 .

[6]  Faculteit Economie,et al.  AN ELECTROMAGNETISM META-HEURISTIC FOR THE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM , 2004 .

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

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

[9]  Mostafa Zandieh,et al.  Group scheduling in flexible flow shops: a hybridised approach of imperialist competitive algorithm and electromagnetic-like mechanism , 2011 .

[10]  M. Zandieh,et al.  Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times , 2010 .

[11]  Fawaz S. Al-Anzi,et al.  The two-stage assembly scheduling problem to minimize total completion time with setup times , 2009, Comput. Oper. Res..

[12]  Ching-Shih Tsou,et al.  An Electromagnetism-Like Meta-Heuristic for Multi-Objective Optimization , 2006, 2006 IEEE International Conference on Evolutionary Computation.

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

[14]  Reza Tavakkoli-Moghaddam,et al.  A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness , 2009, Soft Comput..

[15]  Bert De Reyck,et al.  A hybrid scatter search/electromagnetism meta-heuristic for project scheduling , 2006, Eur. J. Oper. Res..

[16]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[17]  Mostafa Zandieh,et al.  Hybrid Electromagnetism-Like Algorithm for the Flowshop Scheduling with Sequence-Dependent Setup Times , 2008 .

[18]  Liang Gao,et al.  A NEW HEURISTIC-EM FOR PERMUTATION FLOWSHOP SCHEDULING , 2006 .

[19]  Mario Vanhoucke,et al.  AN ELECTROMAGNETISM META-HEURISTIC FOR THE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM , 2004 .

[20]  Shu-Cherng Fang,et al.  An Electromagnetism-like Mechanism for Global Optimization , 2003, J. Glob. Optim..

[21]  Pierre Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

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

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

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

[25]  J.-S. Chen,et al.  Scheduling alternative operations in two-machine flow-shops , 1997 .

[26]  Pankaj Chandra,et al.  Permutation flow shop scheduling with earliness and tardiness penalties , 2004 .

[27]  Pei-Chann Chang,et al.  A Hybrid Electromagnetism-Like Algorithm for Single Machine Scheduling Problem , 2009, ICIC.

[28]  Iraj Mahdavi,et al.  Single machine scheduling with controllable processing times to minimize total tardiness and earliness , 2013, Comput. Ind. Eng..

[29]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[30]  Anton V. Eremeev,et al.  A Genetic Algorithm for the Allocation of Buffer Storage Capacities in a Production Line with Unreliable Machines , 2002, J. Math. Model. Algorithms.

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

[32]  Zhao You-li.  Single Machine Scheduling Problems with Learning Effect , 2006 .

[33]  Shu-Cherng Fang,et al.  On the Convergence of a Population-Based Global Optimization Algorithm , 2004, J. Glob. Optim..

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

[35]  Fawaz S. Al-Anzi,et al.  The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time , 2008 .

[36]  Maged Dessouky,et al.  Sequence-dependent batch chemical scheduling with earliness and tardiness penalties , 2001 .

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

[38]  Christos Koulamas,et al.  A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines , 2007, Eur. J. Oper. Res..

[39]  Paolo Toth,et al.  An electromagnetism metaheuristic for the unicost set covering problem , 2010, Eur. J. Oper. Res..

[40]  Subramaniam Balakrishnan,et al.  Cooperative dispatching for minimizing mean flowtime in a dynamic flowshop , 2008 .

[41]  Mostafa Zandieh,et al.  Scheduling of a no-wait two-machine flow shop with sequence-dependent setup times and probable rework using robust meta-heuristics , 2012 .