Dual Flow Shops Scheduling with Family Setup Times
碩士 === 國立交通大學 === 工業工程與管理系所 === 97 === This research examines a dual flow shop scheduling problem, which is in the context of considering cross-plant processing and setup times. The scheduling objective is to minimize coefficient of variation of slack times, in which the slack time of a job denotes...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/58212625212611214531 |