Approximation and Optimal Algorithms for Scheduling Jobs subject to Release Dates
博士 === 國立中山大學 === 應用數學系研究所 === 91 === In this dissertation, we study the single machine scheduling problem with an objective of minimizing the total completion time subject to release dates. The problem, denoted 1|rj ΣCj ,was known to be strongly NP-hard and both theoretically and practically import...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/51747791127813162707 |