An ACO Algorithm with a Job-Sequence-Based Chromosome Representation for Scheduling Distributed Flexible Job Shops
碩士 === 國立交通大學 === 工業工程與管理學系 === 100 === This research examines a distributed and flexible job shops scheduling problem (DFJSP). With NP-hard in complexity, the DFJSP problem involves three sub-decisions: (1) job-to-cell assignment, (2) operation sequencing, and (3) operation-to-machine assignment. S...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/24375908712350106618 |