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