Parallel Machine Scheduling with Machine Availability and Eligibility Constraints
碩士 === 國立中央大學 === 工業管理研究所 === 93 === In this paper we consider the problem of scheduling n non-preemptive jobs on m identical machines with availability and eligibility constraints for minimizing the maximum lateness. That is, each machine is not continuously available at all time and each job is on...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/03688628551173651255 |