摘要
This paper presents a new particle swarm optimization (PSO) for the open shop scheduling problem. Compared with the original PSO, we modified the particle position representation using priorities, and the particle movement using an insert operator. We also implemented a modified parameterized active schedule generation algorithm (mP-ASG) to decode a particle position into a schedule. In mP-ASG, we can reduce or increase the search area between non-delay schedules and active schedules by controlling the maximum delay time allowed. Furthermore, we hybridized our PSO with beam search. The computational results show that our PSO found many new best solutions of the unsolved problems.
学科与关键词
关键词
particle swarm optimizationopen shop scheduling
- A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMSGe, H. W.; Liang, Y. C.*; Zhou, Y.; Guo, X. C.International Journal of Computational Methods, 2005, 2(3): 419-430.被引 20
- A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasksTseng, Chao-Tang; Liao, Ching-Jong*International Journal of Production Research, 2008, 46(17): 4655-4670.被引 89
- An improved particle swarm optimization algorithm for flowshop scheduling problemZhang, Changsheng*; Sun, Jigui; Zhu, Xingiun; Yang, QingyunINFORMATION PROCESSING LETTERS, 2008, 108(4): 204-209.被引 30
