Parallel machine scheduling with machine availability, eligibility and job family constraints for optimizing minimum makespan
碩士 === 國立中央大學 === 工業管理研究所 === 98 === In this paper we first consider the scheduling problem of n preemptive jobs on m identical parallel machine with machine availability, eligibility and job family constraints when minimizing the maximum completion time. Then we extend the scheduling problem to n n...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/77974791214704958830 |