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