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

Journal of Manufacturing Systems - Tập 36 - Trang 189-202 - 2015
A. Ghodratnama1, F. Jolai2, R. Tavakkoli-Moghaddam2
1Department of Industrial Engineering, Faculty of Engineering, Kharazmi University, Karaj, Iran
2School of Industrial Engineering and Research Institute of Energy Management & Planning, College of Engineering, University of Tehran, Tehran, Iran

Tài liệu tham khảo

Salvador, 1973, A solution to a special class of flow shop scheduling problems, 83 Adler, 1993, A scheduling support system for the packaging industry, J Oper Res, 41, 641, 10.1287/opre.41.4.641 Guinet, 1996, Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time, J Prod Res, 34, 1643, 10.1080/00207549608904988 Agnetis, 1997, Scheduling of flexible flow lines in an automobile assembly plant, Eur J Oper Res, 97, 348, 10.1016/S0377-2217(96)00203-2 Sawik, 2000, Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers, Math Comput Model, 31, 39, 10.1016/S0895-7177(00)00110-2 Koehher, 1987, Heuristic methods for flexible flow line scheduling, J Manuf Syst, 6, 299, 10.1016/0278-6125(87)90006-9 Um, 2009, The simulation design and analysis of a flexible manufacturing system with automated guided vehicle system, J Manuf Syst, 28, 299, 10.1016/j.jmsy.2010.06.001 Javadi, 2008, No-wait flow shop scheduling using fuzzy multi-objective linear programming, J Frankl Instit, 345, 452, 10.1016/j.jfranklin.2007.12.003 Tavakkoli-Moghaddam, 2009, A memetic algorithm for the flexible flow line scheduling problem with processor blocking, Comput Oper Res, 36, 402, 10.1016/j.cor.2007.10.011 Chen, 2009, A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines, Comput Oper Res, 36, 3073, 10.1016/j.cor.2009.02.004 Jungwattanakit, 2009, A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria, Comput Oper Res, 36, 3073, 10.1016/j.cor.2007.10.004 Naderi, 2010, Algorithms for a realistic variant of flowshop scheduling, Comput Oper Res, 236, 10.1016/j.cor.2009.04.017 Quadt, 2007, A taxonomy of flexible flow line scheduling procedures, Eur J Oper Res, 178, 686, 10.1016/j.ejor.2006.01.042 Behnamian, 2011, Hybrid flowshop scheduling with machine and resource-dependent processing times, Appl Math Model, 35, 1107, 10.1016/j.apm.2010.07.057 Kurz, 2004, Scheduling flexible flow lines with sequence-dependent setup times, Eur J Oper Res, 159, 66, 10.1016/S0377-2217(03)00401-6 Ruiz, 2010, The hybrid flow shop scheduling problem, Eur J Oper Res, 205, 1, 10.1016/j.ejor.2009.09.024 Jenabi, 2007, Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines, Appl Math Comput, 186, 230, 10.1016/j.amc.2006.06.121 Harjunkoski, 2002, Decomposition techniques for multistage scheduling problems using mixed integer and constraint programming methods, Comput Chem Eng, 26, 1533, 10.1016/S0098-1354(02)00100-X Michalewicz, 2000 Blazewicz, 2001 Veldhuizen, 2000, Multiobjective evolutionary algorithms: analyzing the state-of-the-art, Evol Comput, 8, 125, 10.1162/106365600568158 Deb, 2002, A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II, IEEE Trans Evolut Comput, 6, 103, 10.1109/4235.996017 Konak, 2006, Multi-objective optimization using genetic algorithms: a tutorial, Reliab Eng Syst Saf, 91, 992, 10.1016/j.ress.2005.11.018 Deb, 2003, Reliable classification of two-class cancer data using evolutionary algorithms, Biosystems, 72, 111, 10.1016/S0303-2647(03)00138-2 Rajapakse, 2007, Predicting peptides binding to MHC class ii molecules using multi-objective evolutionary algorithms, BMC Bioinform, 8, 111 Kennedy, 1995, Particle swarm optimization, 1942 Moore, 1999 Reyes-Sierra, 2006, Multi-objective particle swarm optimizers: a survey of the state-of-the-art, Int J Comput Intell Res, 2, 287 Tavakkoli-Moghaddam, 2011, 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, 733, 10.1007/s00170-010-2847-4 Hakimzadeh Abyaneh, 2012, Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers, Int J Adv Manuf Technol, 58, 309, 10.1007/s00170-011-3368-5 Karimi, 2010, Bi-objective group scheduling in hybrid flexible flowshop: a multi-phase approach, Int J Expert Syst Appl, 37, 4024, 10.1016/j.eswa.2009.09.005 Bagheri, 2011, Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—variable neighborhood search approach, Int J Manuf Syst, 30, 8, 10.1016/j.jmsy.2011.02.004 Varadharajan, 2005, A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs, Eur J Oper Res, 167, 772, 10.1016/j.ejor.2004.07.020 Sharapov, 2006, Convergence of genetic algorithms, Pattern Recognit. Image Anal., 16, 392, 10.1134/S1054661806030084