A particle swarm optimization for multi-objective flowshop scheduling

International Journal of Advanced Manufacturing Technology

Volumn 45, Issue 7-8, 2009, Pages 749-758

  Sha, D Y ^a   Hung Lin, Hsing ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Flowshop scheduling; Multi objective; Pareto optimal; PSO

Indexed keywords

BENCH-MARK PROBLEMS; COMPUTATIONAL COSTS; EXACT SOLUTION; FLOWSHOP SCHEDULING; MACHINE IDLE; MAKESPAN; MANUFACTURING SYSTEM; MEAN FLOW TIME; MODIFIED PARTICLE SWARM OPTIMIZATION; MULTI OBJECTIVE ALGORITHM; MULTI-OBJECTIVE; MULTIPLE OBJECTIVES; NEAR-OPTIMAL SOLUTIONS; PARETO OPTIMAL; PARETO OPTIMAL SOLUTIONS; PSO;

COMPUTATIONAL EFFICIENCY; MULTIOBJECTIVE OPTIMIZATION; OPTIMAL SYSTEMS; PARETO PRINCIPLE; SCHEDULING ALGORITHMS;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 70449518389     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-009-1970-6     Document Type: Article

References (32)

1. HG Campbell RA Dudek ML Smith 1970 A heuristic algorithm for the n-job m-machine sequencing problem Manage Sci 16 B630 B637 10.1287/mnsc.16.10.B630 10.1287/mnsc.16.10.B630
2. J Carlier 1978 Ordonnancements à contraintes disjonctives RAIRO Rech Oper. Oper Res 12 333 351 0401.90052 516514
3. K Chakravarthy C Rajendran 1999 A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization Prod Plann Contr 10 707 714 10.1080/095372899232777 10.1080/095372899232777
4. T Eren E Güner 2007 The tricriteria flowshop scheduling problem Int J Adv Manuf Technol 36 1210 1220 10.1007/s00170-007-0931-1 10.1007/s00170-007- 0931-1
5. JND Gupta JEF Stafford 2006 Flowshop scheduling research after five decades Eur J Oper Res 169 699 711 10.1016/j.ejor.2005.02.001 1079.90001 10.1016/j.ejor.2005.02.001 (Pubitemid 41492009)
6. R Gangadharan C Rajendran 1993 Heuristic algorithms for scheduling in no-wait flow shop Int J Prod Econ 32 285 290 10.1016/0925-5273(93) 90042-J 10.1016/0925-5273(93)90042-J
7. SR Hejazi S Saghafian 2005 Flowshop- scheduling problems with makespan criterion: a review Int J Prod Res 43 2895 2929 10.1080/0020754050056417 1068.90059 10.1080/0020754050056417
8. J Heller 1960 Some numerical experiments for an MxJ flow shop and its decision- theoretical aspects Oper Res 8 178 184 10.1287/opre.8.2.178 0092.27910 10.1287/opre.8.2.178 111626
9. B Jarboui S Ibrahim P Siarry A Rebai 2008 A combinational particle swarm optimisation for solving permutation flowshop problems Comput Ind Eng 54 526 538 10.1016/j.cie.2007.09.006 10.1016/j.cie.2007.09.006 (Pubitemid 351199803)
10. J Kennedy R Eberhart 1995 Particle swarm optimization Proc IEEE Int Conf Neural Netw 1995 1942 1948 10.1109/ICNN.1995.488968 10.1109/ICNN.1995.488968
11. Knowles JD, Corne DW (1999) The Pareto archived evolution strategy: a new baseline algorithm for multi-objective optimization. In: Congress on Evolutionary Computation, Washington, DC, IEEE Service Center, 98-105
12. D Laha UK Chakraborty 2008 An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling Int J Adv Manuf Technol 38 1018 1025 10.1007/s00170-007-1156-z 10.1007/s00170-007-1156-z
13. Laha D, Chakraborty UK (2009) A constructive heuristic for minimizing makespan in no-wait flow shop scheduling. Int J Adv Manuf Technol. doi: 10.1007/s00170-008-1545-0
14. Z Lian X Gu B Jiao 2008 A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan Chaos Solitons Fractals 35 851 861 10.1016/j.chaos.2006.05.082 1146.90418 10.1016/j.chaos.2006.05.082 (Pubitemid 47562753)
15. B Liu L Wang YH Jin 2007 An effective PSO-based memetic algorithm for flow shop scheduling IEEE Trans Syst Man Cybern C 37 18 27 10.1109/TSMCB.2006. 883272 10.1109/TSMCB.2006.883272 (Pubitemid 46358476)
16. J Liu CR Reeves 2001 Constructive and composite heuristic solutions to the P//Ci scheduling problem Eur J Oper Res 132 439 452 10.1016/S0377-2217(00) 00137-5 1134.90389 10.1016/S0377-2217(00)00137-5 1838862
17. M Nawaz JR Enscore I Ham 1983 A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem Omega 11 91 95 10.1016/0305-0483(83) 90088-9 10.1016/0305-0483(83)90088-9
18. T Pasupathy C Rajendran RK Suresh 2006 A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs Int J Adv Manuf Technol 27 804 815 10.1007/s00170-004-2249-6 10.1007/s00170-004-2249-6 (Pubitemid 43004635)
19. SG Ponnambalam H Jagannathan M Kataria 2004 A TSP-GA multi-objective algorithm for flow-shop scheduling Int J Adv Manuf Technol 23 909 915 10.1007/s00170-003-1731-x 10.1007/s00170-003-1731-x
20. C Rajendran 1994 A no-wait flow shop scheduling heuristic to minimize makespan J Oper Res Soc 45 472 478 0799.90060 10.1038/sj/jors/0450411
21. C Rajendran H Ziegler 2004 Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs Eur J Oper Res 155 426 438 10.1016/S0377-2217(02) 00908-6 1045.90032 10.1016/S0377-2217(02)00908-6 2054703
22. A Rahimi-Vahed S Mirghorbani 2007 A multi-objective particle swarm for a flow shop scheduling problem J Comb Optim 13 79 102 10.1007/s10878-006-9015-7 1112.90037 10.1007/s10878-006-9015-7 2273265 (Pubitemid 44771158)
23. CR Reeves 1995 A genetic algorithm for flowshop sequencing Comput Oper Res 22 5 13 10.1016/0305-0548(93) E0014-K 0815.90097 10.1016/0305-0548(93)E0014- K
24. R Ruiz C Maroto 2004 A comprehensive review and evaluation of permutation flowshop heuristics Eur J Oper Res 165 479 494 10.1016/j.ejor.2004.04.017 10.1016/j.ejor.2004.04.017
25. DY Sha CY Hsu 2006 A hybrid particle swarm optimization for job shop scheduling problem Comput Ind Eng 51 791 808 10.1016/j.cie.2006.09.002 10.1016/j.cie.2006.09.002 (Pubitemid 44778997)
26. DY Sha CY Hsu 2008 A new particle swarm optimization for the open shop scheduling problem Comput Oper Res 35 3243 3261 10.1016/j.cor.2007.02.019 1133.90017 10.1016/j.cor.2007.02.019 (Pubitemid 351335144)
27. Stützle T (1998) Applying iterated local search to the permutation flow shop problem. Tech Rep, AIDA-98-04, FG Intellektik, TU Darmstadt
28. E Taillard 1993 Benchmarks for basic scheduling problems Eur I Oper Res 64 278 285 10.1016/0377-2217(93) 90182-M 0769.90052 10.1016/0377-2217(93)90182-M
29. MF Tasgetiren YC Liang M Sevkli G Gencyilmaz 2007 A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem Eur J Oper Res 177 1930 1947 10.1016/j.ejor.2005.12.024 1110.90044 10.1016/j.ejor.2005.12.024 (Pubitemid 44780934)
30. B Yagmahan MM Yenisey 2008 Ant colony optimization for multi-objective flow shop scheduling problem Comput Ind Eng 54 411 420 10.1016/j.cie.2007.08.003 10.1016/j.cie.2007.08.003 (Pubitemid 351199794)
31. H Zhang X Li H Li F Huang 2005 Particle swarm optimization-based schemes for resource-constrained project scheduling Auto Const 14 393 404 10.1016/j.autcon.2004.08.006 10.1016/j.autcon.2004.08.006 (Pubitemid 40183430)
32. Zizter E, Laumanns M, Thiele L (2001) SPEA2: Improving the strength Pareto evolutionary algorithm. Computer Engineering and Networks Laboratory (TIK) - Report 103 Sept 2001