A Polynomial Time Approximation Scheme for Parallel Machine Scheduling with Machine Availability Constraints
碩士 === 國立中央大學 === 工業管理研究所 === 106 === This study analyzes the makespan minimization problem of non-preemptively scheduling identical parallel machines where machines may be unavailable during arbitrary time intervals. Assuming at least one machine is always available throughout the planning horizon,...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/2rfyk8 |