A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan

Applied Mathematics and Computation

Volumn 183, Issue 2, 2006, Pages 1008-1017

  Lian, Zhigang ^a   Jiao, Bin ^a,b   Gu, Xingsheng ^a  

^a EAST CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b SHANGHAI DIANJI UNIVERSITY   (China)

Author keywords

Job shop scheduling; Particle swarm optimization; SPSO algorithm

Indexed keywords

COMPUTER SIMULATION; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

JOB-SHOP SCHEDULING; PARTICLE SWARM OPTIMIZATION; SPSO ALGORITHM;

GENETIC ALGORITHMS;

EID: 33845737026     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2006.05.168     Document Type: Article

References (16)

1. R. Eberhart, J. Kennedy, A new optimizer using particle swarm theory, in: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, 1995, pp. 39-43.
2. 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-616
3. R.C. Eberhart, Y. Shi, Particle swarms optimization: developments, applications and resources, in: Proceedings of the Congress on Evolutionary Computation 2001 IEEE Service Center, Piscataway, NJ, Seoul, Korea, 2001.
4. Federico D.C., et al. A genetic algorithm for the job shop problem. Computers and Operational Research 22 1 (1995) 15-24
5. J. Kennedy, R. Eberhart, Particle swarm optimization, in: IEEE International Conference on Neural Networks, Perth, Australia, 1942-1948, 1995.
6. S. Kobayashi, I. Ono, M. Yamamura, An efficient genetic algorithm for job shop scheduling problems, in: Proceedings of ICGA'95, 1995, pp. 506-511.
7. Lian Z.G., Gu X.S., and Jiao B. A similar particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Applied Mathematics and Computation (2005)
8. R. Nakano, T. Yamada, Conventional genetic algorithm for job shop problem, in: Proceeding of the 4th International Conference on Genetic Algorithm, 1991, pp. 474-479.
9. I. Ono, M. Yamamura, S. Kobayashi, A genetic algorithm for job-shop scheduling problems using job-based order crossover, in: Proceedings of ICEC'96, 1996, pp. 547-552.
10. J. Robinson, S. Sinton, Y. Rahmat-Samii, Particle swarm, genetic algorithm, and their hybrids: optimization of a profiled corrugated horn antenna, in: IEEE Antennas and Propagation Society International Symposium and URSI National Radio Science Meeting, IEEE, San Antonio, TX, 2002, pp. 168-175.
11. Shi G. A genetic algorithm applied to a classic job-shop scheduling problem. International Journal of Systems Science 28 1 (1997) 25-32
12. Y. Shi, R. Eberhart, A modified particle swarm optimizer, in: IEEE World Congress on Computational Intelligence, 1998, pp. 69-73.
13. Y. Shi, R.C. Eberhart, Parameter selection in particle swarm optimization, in: Evolutionary Programming VII: Proceedings of the Seventh Annual Conference on Evolutionary Programming, New York, 1998, pp. 591-600.
14. Trelea I.C. The particle swarm optimization algorithm: convergence analysis and parameter selection. Information Processing Letters 85 6 (2003) 317-325
15. Yamada T., and Nakano R. A genetic algorithm applicable to large-scale job shop problems. Parallel Problem Solving from Nature 2 (1992) 281-290
16. Wei X.J., and Wu Z.M. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers and Industrial Engineering 48 (2005) 409-425