A dual similar particle swarm optimization algorithm for job-shop scheduling with penalty

Proceedings of the World Congress on Intelligent Control and Automation (WCICA)

Volumn 2, Issue , 2006, Pages 7312-7316

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

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

^b SHANGHAI DIANJI UNIVERSITY   (China)

Author keywords

Dual similar particle swarm optimization algorithm; Due date; Job shop scheduling; Maximize profit

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MATHEMATICAL MODELS; OPTIMIZATION; PROFITABILITY; SCHEDULING;

DUAL SIMILAR PARTICLE SWARM OPTIMIZATION ALGORITHMS; JOB SHOP SCHEDULING; PROFIT MAXIMIZATION;

PRODUCTION CONTROL;

EID: 34047221991     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCICA.2006.1714506     Document Type: Conference Paper

References (18)

1. R. Eberhart, J. Kennedy, A New Optimizer Using Particle Swarm Theory[C]. In: Proc of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, 1995, 39-43.
2. R.C. Eberhart, Y. Shi, Comparison between genetic algorithms and particle swarm optimization, Evolutionary Programming VII: Proceedings of the Seventh Annual Conference on Evolutionary Programming, Springer-Verlag, Berlin, 1998, pp. 611-616, San Diego, CA.
3. R.C. Eberhart, Y. Shi, Tracking and optimizing dynamic systems with particle swarms, Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2001), IEEE, Seoul, Korea, 2001, pp. 94-97.
4. Eberhart, R. C. and Shi, Y. Particle swarms optimization: developments, applications and resources. Proc. congress on evolutionary computation 2001 IEEE service center, Piscataway, NJ., Seoul, Korea., 2001.
5. D.C. et al. Federico, A genetic algorithm for the job shop problem [J]. Computers Ops Res, 1995, 22 (1): 15-24.
6. J, Kennedy, R. Eberhart, Particle Swarm Optimization[C]. In: IEEE Intl Conf on Neural Networks, Perth, Australia, 1995, 1942-1948.
7. S. Kobayashi, I. Ono and M. Yamamura, An efficient genetic algorithm for job shop scheduling problems [A]. Proc. of ICGA'95[C], 1995, 506-511.
8. Z.G.Lian, X.S.Gu, B.Jiao, A similar particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan[J], Applied Mathematics and Computation. (2005).
9. Z.G.Lian, B.Jiao, X.S.Gu, A PSOA-GA-based hybrid algorithm for permutation job-shop scheduling to minimize makespan [J], Journal of Algorithms.(2005).
10. Z.G.Lian, X.S.Gu, Q.Niu, A maximizing the profit with penalty of flow-shop scheduling problem from restrictive due-date, Proceedings of Asia Simulation Conference 2005/The Sixth International Conference on System Simulation and Scientific Computing (Beijing).
11. th. International Conference on Genetic Algorithm[C], 1991, 474-479.
12. T. Ono, M. Yamamura and S. Kobayashi, A genetic algorithm for job-shop scheduling problems using job-based order crossover [A]. Proc. of TCEC'96, 1996, 547-552.
13. J. Robinson, S. Sinton, Y. Rahmat-Samii, Particle swarm, genetic algorithm, and their hybrids: optimization of a profiled corrugated horn antenna, IEEE Antennas and Propagation Society International Symposium and URSI National Radio Science Meeting, IEEE, San Antonio, TX, 2002, pp. 168-175.
14. G. Shi, A genetic algorithm applied to a classic job-shop scheduling problem, International Journal of Systems Science, 1997, 28(1), 25-32.
15. Y. Shi, R. Eberhart, A modified particle swarm optimizer [C]. In: IEEE World Congress on Computational Intelligence, 1998, 69-73.
16. Y. Shi, R.C. Eberhart, Parameter selection in particle swarm optimization, Evolutionary Programming VII: Proceedings of the Seventh Annual Conference on Evolutionary Programming, 1998, pp. 591-600, New York.
17. I.C. Trelea, The particle swarm optimization algorithm: convergence analysis and parameter selection, Information Processing Letters 85 (6) (2003) 317-325.
18. T. Yamada, R. Nakano, A genetic algorithm applicable to large-scale job shop problems, Parallel Problem Solving from Nature 2 (1992) 281-290.