Identical Parallel Machine Scheduling with Machine Availability and Eligibility Constraints to Minimize Total Completion Time
碩士 === 國立中央大學 === 工業管理研究所 === 104 === In most scheduling problem, machines are always continuously available to process jobs all the time. However, it usually exist unavailable time intervals for routine maintenance in practice. Besides, some job is suitable for specific machines to process based on...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/13102491865591919822 |