A Genetic Algorithm of Non-permutation Flow Shop Manufacturing Cell Scheduling with Sequence Dependent Setups
碩士 === 國立交通大學 === 工業工程與管理學系 === 98 === This research is concerned with the scheduling of a non-permutation flowline manufacturing cell with sequence-dependent family setup times. We develop a new chromosome representation scheme. Based on the new representation and a prior one, two genetic algorithm...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/27064697021250858626 |
| Summary: | 碩士 === 國立交通大學 === 工業工程與管理學系 === 98 === This research is concerned with the scheduling of a non-permutation flowline manufacturing cell with sequence-dependent family setup times. We develop a new chromosome representation scheme. Based on the new representation and a prior one, two genetic algorithms are proposed to solve the scheduling problem. These two algorithms, respectively called GA-T (a prior algorithm) and GA-N (a proposed algorithm), adopt the same evolutionary mechanism but with different chromosome representation schemes. Numerical experiments indicate that GA-N outperforms GA-T in most test cases. This finding implies that developing new chromosome representation schemes might lead to better solutions quality for a particular meta-heuristic evolutionary mechanism. Choosing an appropriate chromosome representation is therefore very important to meta-heuristic algorithms.
|
|---|