A Novel Adapted Multi-objective Meta-heuristic Algorithm for a Flexible Bi-objective Scheduling Problem Based on Physics Theory

We relax some assumptions of the traditional scheduling problem and suggest an adapted meta-heuristic algorithm to optimize efficient utilization of resources and quick response to demands simultaneously. We intend to bridge the existing gap between theory and real industrial scheduling assumptions (e.g., hot metal rolling industry, chemical and pharmaceutical industries). We adapt and evaluate a well-known algorithm based on electromagnetic science. The motivation behind our proposed meta-heuristic approach has arisen from the attraction-repulsion mechanism of electromagnetic theories in physics. In this basic idea, we desire to bring our search closer to a region with a superior objective function while going away from the region with the inferior objective function in order to move the solution gradually towards optimality. The algorithm is carefully evaluated for its performance against two existing algorithms using multi-objective performance measures and statistical tools. The results show that our proposed solution method outperforms the others.

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

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

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

[4]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

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

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

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

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

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

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

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

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

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

[14]  DebK.,et al.  A fast and elitist multiobjective genetic algorithm , 2002 .

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

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

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

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

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

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

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

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