Scheduling a flowline manufacturing cell with sequence dependent family setup times by an iterated greedy algorithm
碩士 === 華梵大學 === 工業工程與經營資訊學系碩士班 === 97 === Over the last decade, three major metaheuristecs have been applied to the Flowline Manufacturing Cell Scheduling Problem (FMCSP) with Sequence Dependent Flowline Setup Times (SDFSTs) to compute minimum makespan. Unfortunately, tabu search algorithm, genetic...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/67679735313016283213 |