Solving a multi-objective job shop scheduling problem with sequence-dependent setup times by a Pareto archive PSO combined with genetic operators and VNS

International Journal of Advanced Manufacturing Technology

Volumn 53, Issue 5-8, 2011, Pages 733-750

  Tavakkoli Moghaddam, Reza ^a   Azarkish, Mozhgan ^a   Sadeghnejad Barkousaraie, Azar ^a  

^a UNIVERSITY OF TEHRAN   (Iran)

Author keywords

Genetic operators; Multi objective job shop scheduling; Pareto archive PSO; Sequence dependent setup times; VNS

Indexed keywords

GENETIC OPERATORS; MULTI OBJECTIVE; PARETO ARCHIVE PSO; SEQUENCE-DEPENDENT SETUP TIMES; VNS;

GENETIC ALGORITHMS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL OPERATORS; MULTIOBJECTIVE OPTIMIZATION; PARETO PRINCIPLE;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 79953050971     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-010-2847-4     Document Type: Article

References (40)

1. R Tavakkoli-Moghaddam N Safaei F Sassani 2009 A memetic algorithm for the flexible flow line scheduling problem with processor blocking Comput Oper Res 36 402 414 2579928 1157.90428 10.1016/j.cor.2007.10.011
2. V Vinoda R Sridharan 2008 Scheduling a dynamic job shop production system with sequence-dependent setups: an experimental study Rob Comput Integr Manuf 24 435 449 10.1016/j.rcim.2007.05.001 (Pubitemid 351312261)
3. B Ombuki M Ventresca 2004 Local search genetic algorithms for the job shop scheduling problem Appl Intell 21 99 109 1078.68597 10.1023/B:APIN. 0000027769.48098.91
4. R Tavakkoli-Mogahddam N Safaei MMO Kah 2008 Accessing feasible space in a generalized job shop scheduling problem with the fuzzy processing times: a fuzzy-neural approach J Oper Res Soc 59 431 442 10.1057/palgrave.jors.2602351 (Pubitemid 351438514)
5. M Sakawa R Kubota 2000 Theory and methodology: fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy due date through genetic algorithms Eur J Oper Res 120 393 407 1783303 0954.90071 10.1016/S0377-2217(99)00094-6 (Pubitemid 30542643)
6. L Wang DZ Zheng 2001 An effective hybrid optimization strategy for job-shop scheduling problems Comput Oper Res 28 585 596 1824630 1017.90048 10.1016/S0305-0548(99)00137-9
7. T Kis 2003 Job-shop scheduling with processing alternatives Eur J Oper Res 151 307 332 2014079 1052.90033 10.1016/S0377-2217(02)00828-7
8. Grabowski J, Wodecki M (2005) A very fast tabu search algorithm for job shop problem. In: Rego C, Alidaee B (eds) Metaheuristic optimization via memory and evolution; tabu search and scatter search. Kluwer, Dordrecht, pp 117-144
9. S Thiagarajan C Rajendran 2005 Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs Comput Ind Eng 49 463 503 10.1016/j.cie.2005.06.005 (Pubitemid 41689975)
10. R Tavakkoli-Moghaddam M Daneshmand-Mehr 2005 A computer simulation model for job shop scheduling problems minimizing makespan Comput Ind Eng 48 811 823 10.1016/j.cie.2004.12.010 (Pubitemid 40391499)
11. C Low TH Wu C-M Hsu 2005 Mathematical modelling of multi-objective job shop scheduling with dependent setups and re-entrant operations Int J Adv Manuf Technol 27 181 189 10.1007/s00170-004-2137-0 (Pubitemid 41677220)
12. G Cavory R Dupas G Goncalves 2005 A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints Eur J Oper Res 161 73 85 2095873 1065.90034 10.1016/j.ejor.2003.03.001
13. B Naderi M Khalili R Tavakkoli-Moghaddam 2009 A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time Comput Ind Eng 56 1494 1501 10.1016/j.cie.2008.09.031
14. R Tavakkoli-Moghaddam F Jolai F Vaziri PK Ahmed A Azaron 2005 A hybrid method for solving stochastic job shop scheduling problems Appl Math Comput 170 185 206 2177215 1091.90026 10.1016/j.amc.2004.11.036 (Pubitemid 41454805)
15. RK Suresh KM Mohanasundaram 2006 Pareto archived simulated annealing for job shop scheduling with multiple objectives Int J Adv Manuf Technol 29 184 196 10.1007/s00170-004-2492-x (Pubitemid 43814089)
16. Z Lian B Jiao X Gu 2006 A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan Appl Math Comput 183 1008 1017 2290855 1112.90029 10.1016/j.amc.2006.05.168 (Pubitemid 46014650)
17. D Petrovic A Duenas S Petrovic 2007 Decision support tool for multi-objective job shop scheduling problems with linguistically quantified decision functions Decis Support Syst 43 1527 1538 10.1016/j.dss.2006.06.006 (Pubitemid 47223482)
18. J Blazewicz E Pesch M Sterna F Werner 2007 A note on the two machine job shop with the weighted late work criterion J Sched 10 87 95 2326427 1154.90417 10.1007/s10951-006-0005-5 (Pubitemid 46325885)
19. KL Huang CJ Liao 2008 Ant colony optimization combined with taboo search for the job shop scheduling problem Comput Oper Res 35 1030 1046 2578042 1180.90123 10.1016/j.cor.2006.07.003 (Pubitemid 47404760)
20. N Zribi A El Kamel P Borne 2008 Minimizing the makespan for the MPM job-shop with availability constraints Int J Prod Econ 112 151 160 10.1016/j.ijpe.2007.01.014 (Pubitemid 351179597)
21. R Tavakkoli-Moghaddam M Khalili B Naderi 2009 A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness Soft Comput 13 995 1006 10.1007/s00500-008-0367-z
22. W Bo-zejko M Makuchowski 2009 A fast hybrid tabu search algorithm for the no-wait job shop problem Comput Ind Eng 56 1502 1509 10.1016/j.cie.2008.09.023
23. B Naderi M Zandieh SMT Fatemi Ghomi 2009 Scheduling sequence-dependent setup time job shops with preventive maintenance Int J Adv Manuf Technol 43 170 181 10.1007/s00170-008-1693-0
24. R Tavakkoli-Moghaddam AR Rahimi-Vahed AH Mirzaei 2008 Solving a multi-objective no-wait flow shop scheduling problem by an immune algorithm Int J Adv Manuf Technol 36 969 981 10.1007/s00170-006-0906-7 (Pubitemid 351431708)
25. U Buscher L Shen 2009 Discrete optimization: an integrated tabu search algorithm for the lot streaming problem in job shops Eur J Oper Res 199 385 399 1176.90197 10.1016/j.ejor.2008.11.046
26. B Naderi SMT Fatemi Ghomi M Aminnayeri 2010 A high performing metaheuristic for job shop scheduling with sequence dependent setup times Appl Soft Comput 10 3 703 710 10.1016/j.asoc.2009.08.039
27. DN Pham A Klinkert 2008 Surgical case scheduling as a generalized job shop scheduling problem Eur J Oper Res 185 1011 1025 2361745 1146.90420 10.1016/j.ejor.2006.03.059 (Pubitemid 47498795)
28. RL Burdett E Kozan 2010 Production, manufacturing and logistics. A disjunctive graph model and framework for constructing new train schedules Eur J Oper Res 200 85 98 1187.90129 10.1016/j.ejor.2008.12.005
29. JMS Valentea RAFS Alves 2008 Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups Comput Oper Res 35 2388 2405 2585229 10.1016/j.cor.2006.11.004 (Pubitemid 350161143)
30. Y Hendel F Sourd 2007 An improved earliness-tardiness timing algorithm Comput Oper Res 34 2931 2938 1185.90077 10.1016/j.cor.2005.11.004 (Pubitemid 46356730)
31. C Lowa Y Yeh 2009 Genetic algorithm-based heuristics for an open shop scheduling problem with setup, processing, and removal times separated Rob Comput Integr Manuf 25 314 322 10.1016/j.rcim.2007.07.017
32. MA Adibi M Zandieh M Amiri 2010 Multi-objective scheduling of dynamic job shop using variable neighborhood search Expert Syst Appl 37 282 287 10.1016/j.eswa.2009.05.001
33. Kennedy J, Eberhart RC (1995) Particle swarm optimization. In International Conference on Neural Networks, IV (Perth, Australia), Piscataway, NJ, IEEE Service Center, pp 1942-1948
34. Q Niu B Jiao X GU 2008 Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time Appl Math Comput 205 1 148 158 2466619 1175.90187 10.1016/j.amc.2008.05.086
35. V Roshanaei B Naderi F Jolai M Khalili 2009 A variable neighborhood search for job shop scheduling with set-up times to minimize makespan Future Gener Comput Syst 25 654 661 10.1016/j.future.2009.01.004
36. CY Zhang P Li Y Rao Z Guan 2008 A very fast TS/SA algorithm for the job shop scheduling problem Comput Oper Res 35 282 294 2312271 1149.90345 10.1016/j.cor.2006.02.024 (Pubitemid 46899361)
37. K Deb A Pratap S Agarwal T Meyarivan 2002 A fast and elitist multi-objective genetic algorithm: NSGA-II IEEE Trans Evol Comput 6 2 182 197 10.1109/4235.996017 (Pubitemid 34555372)
38. Zitzler E, Laumanns M, Theile L (2001) SPEA II: Improving the strength Pareto evolutionary algorithm. Working Paper, Computer Engineering and Networks Laboratory (TIK), Germany
39. C Low TH Wu C Ming Hsu 2005 Mathematical modelling of multi-objective job shop scheduling with dependent setups and re-entrant operations Int J Adv Manuf Technol 27 181 189 10.1007/s00170-004-2137-0 (Pubitemid 41677220)
40. YP Gupta CR Bector MC Gupta 1990 Optimal schedule on a single machine using various due date determination methods Comput Ind 15 245 254 10.1016/0166-3615(90)90023-I