A new particle swarm optimization for the open shop scheduling problem

  • Authors:

  • D. Y. Sha;Cheng-Yu Hsu

  • Affiliations:

  • Department of Industrial Engineering and System Management, Chung Hua University, Hsinchu 300, Taiwan, ROC and Department of Industrial Engineering and Management, National Chiao Tung University, ...;Department of Industrial Engineering and Management, National Chiao Tung University, 1001 Ta Hsueh Road, Hsinchu 300, Taiwan, ROC

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2008

Quantified Score

Hi-index 0.02

Visualization

Abstract

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.