A Three-Phase PSO Algorithm with an Operation-Sequence-Based Chromosome Representation for Scheduling Flexible Job Shops
碩士 === 國立交通大學 === 工業工程與管理學系 === 100 === This research is concerned with the scheduling of a flexible job-shop problem (called FJSP), which involves two sub-decisions: (1) operation-to-machine assignment (2) operation sequencing for each machine. Most prior studies proposed meta-heuristic algorithms...
Main Authors: | Lai, Chia-Hui, 賴佳卉 |
---|---|
Other Authors: | Wu, Muh-Cherng |
Format: | Others |
Language: | zh-TW |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/51387040206683070924 |
Similar Items
-
An ACO Algorithm with an Operation-Sequence-Based Chromosome Representation for Scheduling Distributed Flexible Job Shops
by: Lin, Chia-Hui, et al.
Published: (2012) -
A Three-Phase GA Algorithm With An Operation-Sequence-Based Chromosome Representation For Scheduling Flexible Job Shops
by: Huang, Chien-Han, et al.
Published: (2012) -
A Genetic Algorithm With Job-Sequence-Based Chromosome Representation for Scheduling Distributed Flexible Job Shops
by: Peng, Yong-Han, et al.
Published: (2012) -
An ACO Algorithm with a Job-Sequence-Based Chromosome Representation for Scheduling Distributed Flexible Job Shops
by: Tan, Hao, et al.
Published: (2012) -
Genetic Algorithms Embedded with Concise Chromosome Representations for Distributed and Flexible Job-shop Scheduling
by: Lu, Po-Hsiang, et al.
Published: (2015)