Solving a new multi-objective multi-route flexible flow line problem by multi-objective particle swarm optimization and NSGA-II

Abstract Mass production, meeting the increasing demands of the customers is a necessity. Such a production is mainly dependent on a factory manufacturing called flow line production. This paper deals with special type of production by the name of flexible manufacturing system, assuming the presence of multi processors in each station of a multi-station arrangement. The model debated in the paper possesses three objective functions, the first of which attempts to minimize the weighted delays. The second objective function tries to minimize the capital for the purchase of the processors at stations and the third objective function minimizes the capital dedicated to select the optimum processing route of parts. For the validation of the mathematical model, use has been made of NSAGAII and MOPSO approaches.

[1]  Michael Pinedo,et al.  BPSS: A Scheduling Support System for the Packaging Industry , 1993, Oper. Res..

[2]  David W. Coit,et al.  Multi-objective optimization using genetic algorithms: A tutorial , 2006, Reliab. Eng. Syst. Saf..

[3]  Vladimir Brusic,et al.  Predicting peptides binding to MHC class II molecules using multi-objective evolutionary algorithms , 2007, BMC Bioinformatics.

[4]  Ignacio E. Grossmann,et al.  Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods , 2002 .

[5]  M. Zandieh,et al.  Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—Variable neighborhood search approach , 2011 .

[6]  Frank Werner,et al.  A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria , 2009, Comput. Oper. Res..

[7]  Hong Chul Lee,et al.  The simulation design and analysis of a Flexible Manufacturing System with Automated Guided Vehicle System , 2009 .

[8]  Rubén Ruiz,et al.  The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[9]  M Reyes Sierra,et al.  Multi-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art , 2006 .

[10]  R. Sharapov,et al.  Convergence of genetic algorithms , 2006, Pattern Recognition and Image Analysis.

[11]  Reza Tavakkoli-Moghaddam,et al.  A memetic algorithm for the flexible flow line scheduling problem with processor blocking , 2009, Comput. Oper. Res..

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

[13]  Ronald G. Askin,et al.  Scheduling flexible flow lines with sequence-dependent setup times , 2004, Eur. J. Oper. Res..

[14]  Giuseppe Oriolo,et al.  Scheduling of Flexible Flow Lines in an Automobile Assembly Plant , 1997 .

[15]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[16]  K. Deb,et al.  Reliable classification of two-class cancer data using evolutionary algorithms. , 2003, Bio Systems.

[17]  S.M.T. Fatemi Ghomi,et al.  Hybrid flowshop scheduling with machine and resource-dependent processing times , 2011 .

[18]  Seyyed M. T. Fatemi Ghomi,et al.  Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines , 2007, Appl. Math. Comput..

[19]  Mostafa Zandieh,et al.  Bi-objective group scheduling in hybrid flexible flowshop: A multi-phase approach , 2010, Expert Syst. Appl..

[20]  Chuen-Lung Chen,et al.  A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines , 2009, Comput. Oper. Res..

[21]  Iraj Mahdavi,et al.  No-wait flow shop scheduling using fuzzy multi-objective linear programming , 2008, J. Frankl. Inst..

[22]  C. Coello,et al.  Multi-Objective Particle Swarm Optimizers : A Survey of the State-ofthe-Art , 2006 .

[23]  Chandrasekharan Rajendran,et al.  A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs , 2005, Eur. J. Oper. Res..

[24]  Michael S. Salvador,et al.  A Solution to a Special Class of Flow Shop Scheduling Problems , 1973 .

[25]  Tadeusz Sawik,et al.  Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers , 2000 .

[26]  Gary B. Lamont,et al.  Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art , 2000, Evolutionary Computation.

[27]  M. Solomon,et al.  Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time , 1996 .

[28]  Mostafa Zandieh,et al.  Algorithms for a realistic variant of flowshop scheduling , 2010, Comput. Oper. Res..

[29]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[30]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[31]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[32]  Oded Maimon,et al.  Evaluation of gene-expression clustering via mutual information distance measure , 2007, BMC Bioinformatics.

[33]  M. Zandieh,et al.  Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers , 2012 .

[34]  Robert J. T. Morris,et al.  Heuristic methods for flexible flow line scheduling , 1987 .

[35]  Heinrich Kuhn,et al.  A taxonomy of flexible flow line scheduling procedures , 2007, Eur. J. Oper. Res..

[36]  R. Tavakkoli-Moghaddam,et al.  Solving a multi-objective job shop scheduling problem with sequence-dependent setup times by a Pareto archive PSO combined with genetic operators and VNS , 2011 .