A revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem

Soft Computing

Volumn 18, Issue 11, 2014, Pages 2271-2282

  Chen, Chun Lung ^a   Huang, Shin Ying ^b   Tzeng, Yeu Ruey ^c   Chen, Chuen Lung ^d  

^a TAKMING UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^b RESEARCH CENTER FOR INFORMATION TECHNOLOGY INNOVATION   (Taiwan)

^c CHINESE CULTURE UNIVERSITY   (Taiwan)

^d NATIONAL CHENGCHI UNIVERSITY   (Taiwan)

Author keywords

Makespan; Particle swarm optimization; Permutation flow shop scheduling problem

Indexed keywords

MACHINE SHOP PRACTICE; SCHEDULING;

BENCH-MARK PROBLEMS; COMPUTATIONAL EXPERIMENT; DISCRETE PARTICLE SWARM OPTIMIZATION; DISCRETE PARTICLE SWARM OPTIMIZATION ALGORITHM; MAKESPAN; MINIMIZING MAKESPAN; PERMUTATION FLOW-SHOP SCHEDULING; PRE-MATURE CONVERGENCES;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 84919390930     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-013-1199-z     Document Type: Article

References (35)

1. Chen S-H, Chang P-C, Cheng TCE, Zhang Q (2012) A self-guided genetic algorithm for permutation flowshop scheduling problems. Comput Oper Res 39:1450–1457
2. Dorigo M, Stützle T (2004) Ant colony optimization. MIT, Cambridge
3. Etiler O, Toklu B, Atak M, Wilson J (2004) A genetic algorithm for flow shop scheduling problems. J Oper Res Soc 55:830–835
4. Garey MR, Johnson DS, Sethi R (1976) The complexity of flow shop and job shop scheduling. Math Oper Res 1:117–129
5. Glover F (1996) Tabu search and adaptive memory programming–advances. Applications and challenges. Kluwer, Boston, pp 1–75
6. Grabowski J, Wodecki M (2004) A very fast tabu search algorithm for the permutation flowshop problem with makespan criterion. Comput Oper Res 31:1891–1909
7. Jarboui B, Ibrahim S, Siarry P, Abdelwaheb R (2008) A combinatorial particle swarm optimization for solving permutation flowshop problems. Comput Ind Eng 54:526–538
8. Kennedy J, Eberhart R (1995) Particle swarm optimization Proc AESF Annu Tech Conf 1995 IEEE Int Conf. Neural Netw 4:1942–1948
9. Kuoa IH, Horng SJ, Kaod TW, Lina TL, Lee CL, Terano T, Pan Y (2009) An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model. Expert Syst Appl 36:7027–7032
10. Lian Z, Gu X, Jiao B (2008) A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Chaos Soliton Fract 35:851–861
11. Marinakis Y, Marinaki M (2013) Particle swarm optimization with expanding neighborhood topology for the permutation flowshop scheduling problem. Soft Comput. doi:10.1007/s00500-013-0992-z
12. Murata T, Ishibuchi H, Tanaka H (1996) Genetic algorithms for flowshop scheduling problems. Comput Ind Eng 30:1061–1071
13. Nowicki E, Smutnicki C (2006) Some aspects of scatter search in the flow-shop problem. Eur J Oper Res 169:654–666
14. Nowicki E, Smutnicki C (1996) A fast tabu search algorithm for the permutation flowshop problem. Eur J Oper Res 91:160–175
15. Ogbu FA, Smith DK (1990) The application of the simulated annealing algorithm to the solution of the n/m/Cmax flow shop problem. Comput Oper Res 17:243–253
16. Osman I, Potts C (1989) Simulated annealing for permutation flow shop scheduling. OMEGA 17:551–557
17. Pan Q-K, Tasgetiren MF, Liang Y-C (2008a) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35:2807–2839
18. Pan Q-K, Tasgetiren MF, Liang Y-C (2008b) A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Comput Ind Eng 55:795–816
19. Pan Q-K, Tasgetiren MF, Suganthan PN, Chua T-J (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf Sci 12:2455–2468
20. Ponnambalm SG, Jawahar N, Chandrasekaran S (2009) Discrete particle swarm optimization algorithm for flowshop scheduling. In: Lazinica A (ed) Particle swarm optimization. InTech, Vienna
21. Rajendran C, Ziegler H (2004) Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. Eur J Oper Res 155:426–438
22. Rameshkumar K, Suresh RK, Mohanasundaram KM (2005) Discrete particle swarm optimization (DPSO) algorithm for permutation flowshop scheduling to minimize makespan. Lect Notes Comput Sci 3612:572–581
23. Reeves CR (1995) A genetic algorithm for flow shop sequencing. Comput Oper Res 22:5–13
24. Ruiz R, Stutzle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177:2033–2049
25. Sipper D, Bulfin R (1997) Production: planning, control, and integration. The McGraw-Hill, New York
26. Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47:65–74
27. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278–285
28. Tasgetiren MF, Liang Y-C, Sevkli M, Gencyilmaz G (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
29. Wang X, Tang L (2012) A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking. Appl Soft Comput 12:652–662
30. Wang Y, Li B, Weise T, Wang J, Yuan B, Tian Q (2011) Self-adaptive learning based particle swarm optimization. Inf Sci 181:4515–4538
31. Ying K-C, Liao C-J (2004) An ant colony system for permutation flow-shop sequencing. Comput Oper Res 31:791–801
32. Zhang C, Jiaxu N, Dantong O (2010a) A hybrid alternate two phases particle swarm optimization algorithm for flow shop scheduling problem. Comput Ind Eng 58:1–11
33. Zhang J, Zhang C, Liang S (2010b) The circular discrete particle swarm optimization algorithm for flow shop scheduling problem. Expert Syst Appl 37:5827–5834
34. Zhigang L, Xingsheng G, Bin J (2006) A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Appl Math Comput 175:773–785
35. Zobolas GI, Tarantilis CD, Ioannou G (2009) Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Comput Oper Res 36:1249–1267