《A multi-objective PSO for job-shop scheduling problems》.pdfVIP

Expert Systems with Applications 37 (2010) 1065–1070 Contents lists available at ScienceDirect Expert Systems with Applications journal homepag e: /locate/eswa A multi-objective PSO for job-shop scheduling problems D.Y. Sha a, Hsing-Hung Lin b,* a Department of Industrial Engineering and System Management, Chung Hua University, Hsin Chu, Taiwan, ROC b Department of Industrial Engineering and Management, National Chiao Tung University, Hsin Chu, Taiwan, ROC a r t i c l e i n f o a b s t r a c t Keywords: Most previous research into the job-shop scheduling problem has concentrated on finding a single opti- Job-shop scheduling mal solution (e.g., makespan), even though the actual requirement of most production systems requires Particle swarm optimization multi-objective optimization. The aim of this paper is to construct a particle swarm optimization (PSO) Multiple objectives for an elaborate multi-objective job-shop scheduling problem. The original PSO was used to solve contin- uous optimization problems. Due to the discrete solution spaces of scheduling optimization problems, the authors modified the particle position representation, particle movement, and particle velocity in this study. The modified PSO was used to solve various benchmark problems. Test results demonstrated that the modified PSO performed better in search quality and efficie