標題: A multi-objective PSO for job-shop scheduling problems
作者: Sha, D. Y.
Lin, Hsing-Hung
工業工程與管理學系
Department of Industrial Engineering and Management
關鍵字: Job-shop scheduling;Particle swarm optimization;Multiple objectives
公開日期: 1-三月-2010
摘要: Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal Solution (e g.. makespan), even though the actual requirement of most production systems requires multi-objective optimization file aim of this paper is to construct a particle swarm optimization (PSO) for an elaborate multi-objective job-shop scheduling problem The original PSO was used to solve continuous 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 efficiency than traditional evolutionary heuristics. (C) 2009 Elsevier Ltd. All rights reserved.
URI: http://dx.doi.org/10.1016/j.eswa.2009.06.041
http://hdl.handle.net/11536/5767
ISSN: 0957-4174
DOI: 10.1016/j.eswa.2009.06.041
期刊: EXPERT SYSTEMS WITH APPLICATIONS
Volume: 37
Issue: 2
起始頁: 1065
結束頁: 1070
顯示於類別:期刊論文


文件中的檔案:

  1. 000272432300020.pdf