A multi-objective electromagnetism algorithm for a bi-objective hybrid no-wait flowshop scheduling problem

This article studies multi-objective hybrid no-wait flowshop scheduling problems to minimize both makespan and total tardiness. This article mathematically formulates the problem using an effective multi-objective mixed integer linear programming models. Since the problem is NP-hard and it is difficult to find an optimal solution in a reasonable computational time, an efficient multi-objective electromagnetism algorithm (MOEA) is presented as the solution procedure. Electromagnetism algorithm is known as a flexible and effective population-based algorithm utilizing an attraction/repulsion mechanism to move the particles towards optimality. MOEA is carefully evaluated for its performance against multi-objective immune algorithms and the adaptation of a well-known multi-objective simulated annealing in the relevant literature by means of multi-objective performance measures and statistical tools. The results show that the proposed solution method outperforms the others.

[1]  Ling Wang,et al.  An effective hybrid particle swarm optimization for no-wait flow shop scheduling , 2007 .

[2]  Tarek Y. ElMekkawy,et al.  A genetic algorithm and particle swarm optimization for no-wait flow shop problem with separable setup times and makespan criterion , 2012 .

[3]  Uday K. Chakraborty,et al.  An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling , 2008 .

[4]  Alireza Rahimi-Vahed,et al.  A multi-objective particle swarm for a flow shop scheduling problem , 2006, J. Comb. Optim..

[5]  Reza Tavakkoli-Moghaddam,et al.  A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: Weighted mean completion time and weighted mean tardiness , 2007, Inf. Sci..

[6]  Mohammad Jafar Tarokh,et al.  Using Electromagnetism Algorithm for Determining the Number of kanbans in a Multi-stage Supply Chain System , 2010 .

[7]  John L. Hunsucker,et al.  A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage , 2004, Eur. J. Oper. Res..

[8]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[9]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[10]  Uday K. Chakraborty,et al.  A constructive heuristic for minimizing makespan in no-wait flow shop scheduling , 2009 .

[11]  Józef Grabowski,et al.  Some local search algorithms for no-wait flow-shop problem with makespan criterion , 2005, Comput. Oper. Res..

[12]  Chuen-Lung Chen,et al.  Genetic algorithms applied to the continuous flow shop problem , 1996 .

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

[14]  Chelliah Sriskandarajah,et al.  Performance of scheduling algorithms for no-wait flowshops with parallel machines , 1988 .

[15]  Chao-Hsien Pan,et al.  A study of integer programming formulations for scheduling problems , 1997, Int. J. Syst. Sci..

[16]  Turan Paksoy,et al.  A genetic algorithm approach for multi-objective optimization of supply chain networks , 2006, Comput. Ind. Eng..

[17]  Chung-Cheng Lu,et al.  Metaheuristics for scheduling a no-wait flowshop manufacturing cell with sequence-dependent family setups , 2012 .

[18]  Chandrasekharan Rajendran,et al.  A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .

[19]  Reza Tavakkoli-Moghaddam,et al.  A multi-objective electromagnetism algorithm for a bi-objective flowshop scheduling problem , 2012 .

[20]  Wen-Hung Yang,et al.  AN ELECTROMAGNETISM ALGORITHM OF NEURAL NETWORK ANALYSIS—AN APPLICATION TO TEXTILE RETAIL OPERATION , 2004 .

[21]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[22]  T. P. Bagchi,et al.  Lot streaming and scheduling heuristics for m -machine no-wait flowshops , 2000 .

[23]  D. A. Wismer,et al.  Solution of the Flowshop-Scheduling Problem with No Intermediate Queues , 1972, Oper. Res..

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

[25]  C. Rajendran,et al.  Heuristic algorithms for scheduling in the no-wait flowshop , 1993 .

[26]  B. Naderi,et al.  Multi-objective no-wait flowshop scheduling problems: models and algorithms , 2012 .

[27]  Uday K. Chakraborty,et al.  An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling , 2009 .

[28]  Xingsheng Gu,et al.  A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion , 2012, Comput. Oper. Res..

[29]  Thomas Stützle,et al.  An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives , 2008, Eur. J. Oper. Res..

[30]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[31]  Bertrand M. T. Lin,et al.  Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time , 2004, Comput. Ind. Eng..

[32]  Martin Josef Geiger,et al.  On operators and search space topology in multi-objective flow shop scheduling , 2007, Eur. J. Oper. Res..

[33]  Edy Bertolissi,et al.  Heuristic algorithm for scheduling in the no-wait flow-shop , 2000 .

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

[35]  Lothar Thiele,et al.  A Tutorial on the Performance Assessment of Stochastic Multiobjective Optimizers , 2006 .

[36]  Fariborz Jolai,et al.  A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection , 2009 .

[37]  Rubén Ruiz,et al.  A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem , 2008, INFORMS J. Comput..

[38]  Stefan Voß,et al.  Solving the continuous flow-shop scheduling problem by metaheuristics , 2003, Eur. J. Oper. Res..

[39]  Ali Allahverdi,et al.  A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness , 2004, Comput. Oper. Res..

[40]  Tariq A. Aldowaisan,et al.  NEW HEURISTICS FOR M-MACHINE NO-WAIT FLOWSHOP TO MINIMIZE TOTAL COMPLETION TIME , 2004 .

[41]  Quan-Ke Pan,et al.  Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion , 2011 .

[42]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..