Dual Flow Shops Scheduling with Queue Time Constraint
碩士 === 國立交通大學 === 工業工程與管理系所 === 97 === This research examines a dual flow-shop scheduling problem, which allows cross-shop production and is with queue time constraint (also called Q-time window). Q-time window denotes the longest waiting time that a job is allowed to have between its two consecutiv...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/56989757148244413157 |