A discrete version of particle swarm optimization for flowshop scheduling problems

Computers and Operations Research

Volumn 34, Issue 10, 2007, Pages 3099-3111

  Liao, Ching Jong ^a   Chao Tang Tseng, ^a   Luarn, Pin ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Metaheuristic; Particle swarm optimization; Scheduling

Indexed keywords

COMPUTATIONAL METHODS; GENETIC ALGORITHMS; HEURISTIC PROGRAMMING; METADATA; PROBLEM SOLVING; SCHEDULING;

METAHEURISTICS; PARTICLE SWARM OPTIMIZATION (PSO); PSO ALGORITHM; TOTAL FLOW TIME;

OPTIMIZATION;

EID: 33847609606     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.11.017     Document Type: Article

References (24)

1. Kennedy J., and Eberhart R.C. Particle swarm optimization. Proceedings of IEEE international conference on neural networks (1995), Piscataway, NJ 1942-1948
2. Hu X, Shi Y, Eberhart RC. Recent advances in particle swarm. In: Proceedings of the IEEE congress on evolutionary computation, vol. 1. Oregon: Portland; 2004. p. 90-7.
3. Van den Bergh F., and Engelbrecht A.P. Cooperative learning in neural network using particle swarm optimizers. South African Computer Journal 26 (2000) 84-90
4. El-Galland A.I., El-Hawary M.E., and Sallam A.A. Swarming of intelligent particles for solving the nonlinear constrained optimization problem. Engineering Intelligent Systems for Electrical Engineering and Communications 9 (2001) 155-163
5. Tasgetiren MF, Sevkli M, Liang YC, Gencyilmaz G. Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: Proceedings of the IEEE congress on evolutionary computation, vol. 2, Oregon: Portland; 2004. p. 1412-9.
6. Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G. Particle swarm optimization algorithm for makespan and maximum lateness minimization in permutation flowshop sequencing problem. In: Proceedings of the fourth international symposium on intelligent manufacturing systems, Turkey: Sakarya; 2004. p. 431-41.
7. Demirkol E., Mehta S., and Uzsoy R. Benchmarks for shop scheduling problems. European Journal of Operational Research 109 (1998) 137-141
8. Kennedy J., and Eberhart R.C. A discrete binary version of the particle swarm algorithm. Proceedings of the world multiconference on systemics, cybernetics and informatics (1997), Piscatawary, NJ 4104-4109
9. Etiler O., Toklu B., Atak M., and Wilson J. A genetic algorithm for flow shop scheduling problems. Journal of the Operational Research Society 55 (2004) 830-835
10. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
11. Pinedo M. Scheduling: theory, algorithm, and system. 2nd ed. (2002), Prentice-Hall, Englewood Cliffs, NJ
12. Sridhar J., and Rajendran C. Scheduling in flowshop and cellular manufacturing systems with multiple objectives-a genetic algorithmic approach. Production Planning and Control 7 (1996) 374-382
13. 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
14. Kennedy J., Eberhart R.C., and Shi Y. Swarm intelligence (2001), Morgan Kaufmann, San Francisco, CA
15. Shi Y., and Eberhart R.C. A modified particle swarm optimizer. Proceedings of the IEEE congress on evolutionary computation (1998), Piscataway, NJ 69-173
16. Eberhart R.C., and Kennedy J. A new optimizer using particle swarm theory. Proceedings of the sixth international symposium on micromachine and human science (1995), Nagoya, Japan 39-43
17. Onwubolu G.C. Emerging optimization techniques in production planning and control (2002), Imperial College Press, London
18. Den Besten M, Stützle T, Dorigo M. Ant colony optimization for the total weighted tardiness problem. In: Proceeding PPSN VI, sixth international conference parallel problem solving from nature. Berlin: Springer; 2000. p. 611-20.
19. Campbell H.G., Dudek R.A., and Smith M.L. A heuristic algorithm for the n job, m machine sequencing problem. Management Science 16 (1970) 630-637
20. Dannenbring D. An evaluation of flow shop sequencing heuristics. Management Science 23 (1977) 1174-1182
21. Nawaz M., Enscore E.E., and Ham I. A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA 11 (1983) 91-95
22. Rajendran C., and Chaudhuri D. An efficient heuristic approach to the scheduling of jobs in a flowshop. European Journal of Operational Research 61 (1992) 318-325
23. Framinan J.M., Leisten R., and Ruiz-Usano R. Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation. European Journal of Operational Research 141 (2002) 559-569
24. i scheduling problem. European Journal of Operational Research 132 (2001) 439-452