A Pareto block-based estimation and distribution algorithm for multi-objective permutation flow shop scheduling problem

Multi-objective flow shop scheduling plays a key role in real-life scheduling problem which attract the researcher attention. The primary concern is to find the best sequence for flow shop scheduling problem. Estimation of Distribution Algorithms (EDAs) has gained sufficient attention from the researchers and it provides prominent results as an alternate of traditional evolutionary algorithms. In this paper, we propose the pareto optimal block-based EDA using bivariate model for multi-objective flow shop scheduling problem. We apply a bivariate probabilistic model to generate block which have the better diversity. We employ the non-dominated sorting technique to filter the solutions. To check the performance of proposed approach, we test it on the benchmark problems available in OR-library and then we compare it with non-dominated sorting genetic algorithm-II (NSGA-II). Computational results show that pareto optimal BBEDA provides better result and better convergence than NSGA-II.

[1]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[2]  C. Rajendran Heuristics for scheduling in flowshop with multiple objectives , 1995 .

[3]  Jatinder N. D. Gupta,et al.  Genetic algorithms for the two-stage bicriteria flowshop problem , 1996 .

[4]  H. Ishibuchi,et al.  Multi-objective genetic algorithm and its applications to flowshop scheduling , 1996 .

[5]  Paolo Gaiardelli,et al.  Hybrid genetic algorithmsfor a multiple-objective scheduling problem , 1998, J. Intell. Manuf..

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

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

[8]  J. Framiñan,et al.  An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .

[9]  S. Ponnambalam,et al.  A TSP-GA multi-objective algorithm for flow-shop scheduling , 2004 .

[10]  Suna Kondakci Köksalan,et al.  Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan , 2004, Eur. J. Oper. Res..

[11]  Qingfu Zhang,et al.  DE/EDA: A new evolutionary algorithm for global optimization , 2005, Inf. Sci..

[12]  D. Ravindran,et al.  Flow shop scheduling with multiple objective of minimizing makespan and total flow time , 2005 .

[13]  Uwe Aickelin,et al.  An estimation of distribution algorithm for nurse scheduling , 2007, Ann. Oper. Res..

[14]  Pei-Chann Chang,et al.  Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems , 2008, Appl. Soft Comput..

[15]  Jerzy Kamburowski,et al.  An improved NEH heuristic to minimize makespan in permutation flow shops , 2008, Comput. Oper. Res..

[16]  P. Shahabudeen,et al.  Bi-criteria improved genetic algorithm for scheduling in flowshops to minimise makespan and total flowtime of jobs , 2009, Int. J. Comput. Integr. Manuf..

[17]  Silvia Curteanu,et al.  An elitist non-dominated sorting genetic algorithm enhanced with a neural network applied to the multi-objective optimization of a polysiloxane synthesis process , 2011, Eng. Appl. Artif. Intell..

[18]  Pei-Chann Chang,et al.  A Puzzle-Based Genetic Algorithm with Block Mining and Recombination Heuristic for the Traveling Salesman Problem , 2012, Journal of Computer Science and Technology.

[19]  Pei-Chann Chang,et al.  Extended artificial chromosomes genetic algorithm for permutation flowshop scheduling problems , 2012, Comput. Ind. Eng..

[20]  Pei-Chann Chang,et al.  Memes co‐evolution strategies for fast convergence in solving single machine scheduling problems , 2012 .

[21]  Quan-Ke Pan,et al.  An estimation of distribution algorithm for lot-streaming flow shop problems with setup times , 2012 .

[22]  Abdullah Al Mamun,et al.  Multi-Objective Optimization with Estimation of Distribution Algorithm in a Noisy Environment , 2013, Evolutionary Computation.

[23]  Wei-Hsiu Huang,et al.  A block mining and re-combination enhanced genetic algorithm for the permutation flowshop scheduling problem , 2013 .