Identical Parallel Machine Scheduling with Machine Availability Constraint to Minimize Total Completion Time
碩士 === 國立中央大學 === 工業管理研究所 === 105 === In this research, we consider the scheduling problem with n non-preemptive jobs and m identical parallel machines under availability constraint. Cause of the availability constraint, each machine has its own available processing time. And the objective of our sc...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/9gx6p5 |