The circular discrete particle swarm optimization algorithm for flow shop scheduling problem

Expert Systems with Applications

Volumn 37, Issue 8, 2010, Pages 5827-5834

  Zhang, Jindong ^a   Zhang, Changsheng ^a   Liang, Shubin ^b  

^a JILIN UNIVERSITY   (China)

^b HENAN NORMAL UNIVERSITY   (China)

Author keywords

DPSO; Flow shop scheduling; Mutation; Particle similarity

Indexed keywords

DIFFERENT SCALE; DISCRETE PARTICLE SWARM OPTIMIZATION ALGORITHM; EFFICIENT ALGORITHM; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOP SCHEDULING; LARGE-SCALE FLOWS; MINIMIZING MAKESPAN; NEIGHBORHOOD SEARCH; NEIGHBORHOOD STRUCTURE; SOLUTION QUALITY;

PARTICLE SWARM OPTIMIZATION (PSO); SCHEDULING ALGORITHMS;

MACHINE SHOP PRACTICE;

EID: 77951203560     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2010.02.024     Document Type: Article

References (24)

1. Bassem J., Saber I., Patrick S., and Abdelwaheb R. A combinatorial particle swarm optimisation for solving permutation flowshop problems. Computers and Industrial Engineering archive 54 3 (2008) 526-538
2. Chandrasekaran, S., Ponnambalam, S. G., Suresh, R. K., & Vijayakumar, N. (2006). A Hybrid discrete particle swarm optimization algorithm to solve flow shop scheduling problems. In 2006 IEEE conference on cybernetics and intelligent systems (pp. 1-6).
3. Dimopoulos C., Ali M., and Zalza S. Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and Computations. IEEE Transactions on Evolutionary Computation 4 2 (2000) 93-113
4. Eberhart, R., & Kennedy, J. (1995). A new optimizer using particle swarm theory. In Proc of the sixth international symposium on micro machine and human science, Nagoya, Japan (pp. 39-43).
5. Garey M., Johnson D., and Sethy R. The complexity of flow shop and job shop scheduling[J]. Mathematics of Operations Research 1 2 (1976) 117-129
6. Goldberg D.E. Genetic algorithms in search. Optimization and machine learning (1989), Addison-Wesley, Reading, MA
7. Gupta J.N. A functional heuristic algorithm for flowshop scheduling problem. Operational Research Quarterly 22 1 (1971) 39-47
8. Józef G., and Mieczyslaw W. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Computers and Operations Research 31 11 (2004) 1891-1909
9. Koulamas C. A new constructive heuristic for flow-shop scheduling problem. European Journal of Operational Research 105 (1998) 66-71
10. Lauriere L.J. A language and a program for stating and solving combinatorial problems. Artificial Intelligence 10 1 (1978) 29-127
11. Mehmet, F. T., Mehmet, S., Yun, C. L., & Gunes, G. (2004). Particle swarm optimization algorithm for permutation flowshop sequencing problem. In ANTS workshop (pp. 382-389).
12. Mehmet F.T., Yun C.L., Mehmet S., and Gunes G. A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research 177 3 (2007) 1930-1947
13. Nawaz M., Enscore E., and Ham I. A heuristics algorithm for the m-machine, n-job flowshop sequencing problem. Omega 11 1 (1983) 91-95
14. Nearchou A.C. The effect of various operators on the genetic search for large scheduling problems. International Journal of Production Economy 88 (2004) 191-203
15. Quan, K. P., Fatih, T., & Yun, C. L. (2008). A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers and Operations Research, in press.
16. Quan Q.P., Mehmet F.T., and Yun C.L. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers and Operations Research 35 9 (2008) 2807-2839
17. Rahimi-Vahed A1., and Mirghorbani S. Journal of Combinatorial Optimization 13 1 (2007) 79-102
18. 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
19. Rameshkumar, K., Suresh, R. K., & Mohanasundaram, K. M. (2005). Discrete Particle Swarm Optimization (DPSO) algorithm for permutation flowshop scheduling to minimize makspan. In Proc. ICNC 2005 (pp. 572-581). LNCS 3612.
20. 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
21. Taillard E. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47 1 (1990) 65-74
22. Valente J.M.S., and Alves R.A.F.S. An exact approach to early/tardy scheduling with release dates[J]. Computers and Operations Research 32 11 (2005) 2905-2917
23. van den Bergh, F. (2002). An analysis of particle swarm optimizers. PhD thesis, Department of Computer Science, University of Pretoria, Pretoria, South Africa.
24. Zhigang L., Xingsheng G., and Bin J. A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Applied Mathematics and Computation 175 1 (2006) 773-785