Genetic Algorithms Embedded with Concise Chromosome Representations for Distributed and Flexible Job-shop Scheduling
博士 === 國立交通大學 === 工業工程與管理系所 === 103 === This paper proposes four genetic algorithms (GA_JSA, GA_JS, GA_J, and GA_JCS) for solving distributed and flexible job-shop scheduling (DFJS) problems. A DFJS problem involves three scheduling decisions: (1) job-to-cell assignment, (2) operation-sequencing, an...
Main Authors: | Lu, Po-Hsiang, 盧柏翔 |
---|---|
Other Authors: | Wu, Muh-Cherng |
Format: | Others |
Language: | zh-TW |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/82tfy6 |
Similar Items
-
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) -
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 GA-Tabu Algorithm Based on a New Chromosome Representation for Scheduling Flexible Job Shops
by: Hsu, Chien-Wen, et al.
Published: (2012) -
A Three-Phase PSO Algorithm with an Operation-Sequence-Based Chromosome Representation for Scheduling Flexible Job Shops
by: Lai, Chia-Hui, et al.
Published: (2012)