An improved particle swarm optimization algorithm for flowshop scheduling problem

Information Processing Letters

Volumn 108, Issue 4, 2008, Pages 204-209

  Zhang, Changsheng ^a   Sun, Jigui ^a   Zhu, Xingjun ^a   Yang, Qingyun ^b  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^b CHANGCHUN INSTITUTE OF OPTICS   (China)

Author keywords

Combinatorial problems; Flow shop scheduling problem; Makespan; Particle swarm optimization

Indexed keywords

ALGORITHMS; LEARNING SYSTEMS; MACHINE SHOP PRACTICE; OPTIMIZATION; SCHEDULING; SCHEDULING ALGORITHMS;

COMBINATORIAL PROBLEMS; EFFICIENT ALGORITHMS; FLOW SHOP SCHEDULING PROBLEM; FLOWSHOP-SCHEDULING PROBLEMS; GENETIC OPERATORS; IMPROVED PARTICLE SWARM OPTIMIZATION; MAKESPAN; MINIMIZING MAKESPAN; MUTATION OPERATORS; PARTICLE SWARM OPTIMIZATION; PARTICLE SWARM OPTIMIZATION ALGORITHM; PSO ALGORITHMS;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 52049124538     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.05.010     Document Type: Article

References (31)

1. Dimopoulos C., and Zalza A.M.S. Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and computations. IEEE Transactions on Evolutionary Computation 4 2 (2000) 93-113
2. Valente J.M.S., and Alves R.A.F.S. An exact approach to early/tardy scheduling with release dates. Computers & Operations Research 32 11 (2005) 2905-2917
3. Garey M., Johnson D., and Sethy R. The complexity of flow shop and job shop scheduling. Mathematics of Operations Research 1 2 (1976) 117-129
4. Sadegheih A. Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance. Applied Mathematical Modelling 30 2 (2006) 147-154
5. Rajendran C., and Ziegler H. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155 (2004) 426-438
6. Grabowski J., and Wodecki M. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Computers & Operations Research 31 11 (2004) 1891-1909
7. R. Eberhart, J. Kennedy, A new optimizer using particle swarm theory, In: Proc of the Sixth International Symposium on Micromachine and Human Science, Nagoya, Japan, 1995, pp. 39-43
8. J. Kennedy, R. Eberhart, Particle swarm optimization. In: IEEE Int. Conf. on Neural Networks, Perth, Australia, 1995, pp. 1942-1498
9. He S., Wu Q.H., Wen J.Y., Saunders J.R., and Paton R.C. A particle swarm optimizer with passive congregation. BioSystems 78 (2004) 135-147
10. Trelea I.C. The particle swarm optimization algorithm: convergence analysis and parameter selection. Inform. Process. Lett. 85 6 (2003) 317-325
11. Eberhart R.C., and Shi Y. Comparison between genetic algorithms and particle swarm optimization. Evolutionary Programming VII: Proceedings of the Seventh Annual Conference on Evolutionary Programming (1998), Springer-Verlag, Berlin, San Diego, CA 611-618
12. Bo Liu, Ling Wang, Yi-Hui Jin, Fang Tang, and De-Xian Huang. Improved particle swarm optimization combined with chaos. Chaos, Solitons & Fractals 25 (2005) 1261-1271
13. Ji M.J., and Tang H.W. Application of chaos in simulated annealing. Chaos, Solitons & Fractals 21 (2004) 933-941
14. Lu Z., Shieh L.S., and Chen G.R. On robust control of uncertain chaotic systems: a sliding-mode synthesis via chaotic optimization. Chaos, Solitons & Fractals 18 (2003) 819-827
15. K. Rameshkumar, R.K. Suresh, K.M. Mohanasundaram, Discrete particle swarm optimization (DPSO) algorithm for permutation flowshop scheduling to minimize makspan, in: Proc. ICNC 2005, LNCS, vol. 3612, 2005, pp. 572-581
16. Lian Zhigang, Xingsheng Gu, and Bin Jiao. A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Applied Mathematics and Computation 175 1 (2006) 773-785
17. Lian Zhigang, Xingsheng Gu, and Bin Jiao. A novel particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Chaos, Solitons & Fractals 35 5 (2008) 851-861
18. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning (1989), Addison-Wesley, Reading, MA
19. Koulamas C. A new constructive heuristic for flow-shop scheduling problem. European Journal of Operational Research 105 (1998) 66-71
20. Gupta J.N. A functional heuristic algorithm for flowshop scheduling problem. Operational Research Quarterly 22 1 (1971) 39-47
21. Nawaz M., Enscore Jr. E., and Ham I. A heuristics algorithm for the m-machine, n-job flowshop sequencing problem. Omega 11 1 (1983) 91-95
22. F. van den Bergh, An analysis of particle swarm optimizers, PhD thesis, Department of Computer Science, University of Pretoria, Pretoria, South Africa, 2002
23. Lauriere L. A language and a program for stating and solving combinatorial problems. Artificial Intelligence 10 1 (1978) 29-127
24. Taillard E. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47 1 (1990) 65-74
25. Ruiz R., Maroto C., and Alcaraz J. Two new robust genetic algorithms for the flowshop scheduling problem. OMEGA, the International Journal of Management Science 34 (2006) 461-476
26. Osman I., and Potts C. Simulated annealing for permutation flow-shop scheduling. OMEGA, The International Journal of Management Science 17 6 (1989) 551-557
27. Widmer M., and Hertz A. A new heuristic method for the flow shop sequencing problem. European Journal of Operational Research 41 2 (1989) 186-193
28. Nearchou A.C. The effect of various operators on the genetic search for large scheduling problems. Int. J. Product. Economy 88 (2004) 191-203
29. Aldowaisan T., and Allahvedi A. New heuristics for no-wait flowshops to minimize makespan. Computers and Operations Research 30 8 (2003) 1219-1231
30. Murata T., Ishibuchi H., and Tanaka H. Genetic algorithms for flowshop scheduling problems. Computers and Industrial Engineering 30 4 (1996) 1061-1071
31. Yagmahan B., and Yenisey M.M. Ant colony optimization for multi-objective flow shop scheduling problem. Computers & Industrial Engineering 54 3 (2008) 411-420