| Summary: | 碩士 === 國立交通大學 === 工業工程與管理學系 === 100 === This research is concerned with the scheduling of a distributed flexible job-shop problem (called DFJSP), which involves three sub-decisions: (1) assignment of each job to an appropriate manufacturing cell, (2) assignment of each operation to an appropriate machine, and (3) sequencing all operations assigned to each machine. Most prior studies proposed meta-heuristic algorithms for the DFJSP problem. This research proposes a new solution representation (called Sop), which is intended to model a particular sequence for all operations. Given a particular Sop, by some heuristic rules, we can obtain its three corresponding sub-decisions; which in turn represents a particular scheduling solution. Based on the Sop representation, this research adopts the architecture of ant colony optimization (ACO) algorithms, and develops a meta-heuristic algorithm (called ACO_ Sop). Experiment results indicate that ACO_ Sop out performs prior meta-heuristic algorithms.
|
|---|
