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

Journal of Manufacturing Systems

Volumn 36, Issue , 2015, Pages 189-202

  Ghodratnama, A ^a   Jolai, F ^b   Tavakkoli Moghaddam, R ^b  

^a KHARAZMI UNIVERSITY   (Iran)

^b UNIVERSITY OF TEHRAN   (Iran)

Author keywords

Flexible flow line problem (FFL); MOPSO; Multi objective particle swarm optimization; NSGA II; Processing route

Indexed keywords

FLEXIBLE MANUFACTURING SYSTEMS; MANUFACTURE; PARTICLE SWARM OPTIMIZATION (PSO); PURCHASING;

FLEXIBLE FLOW LINE; MOPSO; MULTI OBJECTIVE PARTICLE SWARM OPTIMIZATION; NSGA-II; PROCESSING ROUTE;

MULTIOBJECTIVE OPTIMIZATION;

EID: 84942295096     PISSN: 02786125     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jmsy.2014.06.009     Document Type: Article

References (34)

1. M.S. Salvador A solution to a special class of flow shop scheduling problems S.E. Elmaghraby, Symposium on the theory of scheduling and its applications 1973 Springer Berlin 83 91
2. L. Adler, N. Fraiman, E. Kobacker, M. Pinedo, T.P. Plotnicoff, and T.P. Wu A scheduling support system for the packaging industry J Oper Res 41 4 1993 641 648
3. A.G.P. Guinet, and M. Solomon Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time J Prod Res 34 6 1996 1643 1654
4. A. Agnetis, A. Pacifici, F. Rossi, M. Lucertini, S. Nicoletti, F. Nicolo, and et al. Scheduling of flexible flow lines in an automobile assembly plant Eur J Oper Res 97 1997 348 362
5. T. Sawik Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers Math Comput Model 31 2000 39 52
6. S. Koehher, and R.J.T. Morris Heuristic methods for flexible flow line scheduling J Manuf Syst 6 4 1987 299 314
7. I. Um, H. Cheon, and H. Lee The simulation design and analysis of a flexible manufacturing system with automated guided vehicle system J Manuf Syst 28 2009 299 314
8. B. Javadi, M. Saidi-Mehrabad, A. Haji, I. Mahdavi, F. Jolai, and N. Mahdavi-Amiri No-wait flow shop scheduling using fuzzy multi-objective linear programming J Frankl Instit 345 2008 452 467
9. R. Tavakkoli-Moghaddam, N. Safaei, and F. Sassani A memetic algorithm for the flexible flow line scheduling problem with processor blocking Comput Oper Res 36 2009 402 414
10. C.L. Chen, and C.L. Chen A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines Comput Oper Res 36 2009 3073 3081
11. J. Jungwattanakit, M. Reodecha, P. Chaovalitwongse, and F. Werner A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria Comput Oper Res 36 2009 3073 3081
12. B. Naderi, R. Ruiz, and M. Zandieh Algorithms for a realistic variant of flowshop scheduling Comput Oper Res 2010 236 246
13. D. Quadt, and H. Kuhn A taxonomy of flexible flow line scheduling procedures Eur J Oper Res 178 2007 686 698
14. J. Behnamian, and S.M.T. Fatemi-Ghomi Hybrid flowshop scheduling with machine and resource-dependent processing times Appl Math Model 35 2011 1107 1123
15. M.E. Kurz, and R.G. Askin Scheduling flexible flow lines with sequence-dependent setup times Eur J Oper Res 159 2004 66 82
16. R. Ruiz, and A. Vazquez-Rodriguez The hybrid flow shop scheduling problem Eur J Oper Res 205 2010 1 18
17. M. Jenabi, S.M.T. Fatemi-Ghomi, S.A. Torabi, and B. Karimi Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines Appl Math Comput 186 2007 230 245
18. I. Harjunkoski, and I.E. Grossmann Decomposition techniques for multistage scheduling problems using mixed integer and constraint programming methods Comput Chem Eng 26 11 2002 1533 1552
19. Z. Michalewicz, and D.B. Fogel How to solve it: modern heuristics 2000 Springer Berlin
20. J. Blazewicz, K.H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz Scheduling computer and manufacturing processes 2nd ed. 2001 Springer Berlin
21. D.A. Veldhuizen, and G.B. Lamont Multiobjective evolutionary algorithms: analyzing the state-of-the-art Evol Comput 8 2 2000 125 147
22. K. Deb, A. Samir, P. Amrit, and T. Meyarivan A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II IEEE Trans Evolut Comput 6 2 2002 103 112
23. A. Konak, D. Coit, and A. Smith Multi-objective optimization using genetic algorithms: a tutorial Reliab Eng Syst Saf 91 9 2006 992 1007
24. K. Deb, and A.R. Reddy Reliable classification of two-class cancer data using evolutionary algorithms Biosystems 72 1-2 2003 111 129
25. M. Rajapakse, B. Schmidt, L. Feng, and V. Brusic Predicting peptides binding to MHC class ii molecules using multi-objective evolutionary algorithms BMC Bioinform 8 459 2007 111 129
26. J. Kennedy, and R.C. Eberhart Particle swarm optimization IEEE International Conference on Neural Networks, IV Piscataway 1995 1942 1948
27. J. Moore, and R. Chapman Application of particle swarm to multi-objective optimization 1999 Department of Computer Science and Software Engineering, Auburn University
28. M. Reyes-Sierra, and C.A.C. Coello Multi-objective particle swarm optimizers: a survey of the state-of-the-art Int J Comput Intell Res 2 2006 287 308
29. R. Tavakkoli-Moghaddam, M. Azarkish, and A. Sadeghnejad-Barkousarair Solving a multi-objective job shop scheduling problem with sequence-dependent setup times by a Pareto archive PSO combined with genetic operators and VNS Int J Adv Manuf Technol 53 2011 733 750
30. S. Hakimzadeh Abyaneh, and M. Zandieh Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers Int J Adv Manuf Technol 58 2012 309 325
31. N. Karimi, M. Zandieh, and H.R. Karamooz Bi-objective group scheduling in hybrid flexible flowshop: a multi-phase approach Int J Expert Syst Appl 37 2010 4024 4032
32. A. Bagheri, and M. Zandieh Bi-criteria flexible job-shop scheduling with sequence-dependent setup times - variable neighborhood search approach Int J Manuf Syst 30 2011 8 15
33. T.K. Varadharajan, and C. Rajendran A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs Eur J Oper Res 167 2005 772 795
34. R.R. Sharapov, and A.V. Lapshin Convergence of genetic algorithms Pattern Recognit. Image Anal. 16 2006 392 397