Minimizing the Total Weighted Completion Time in Resource-constrained Scheduling
碩士 === 國立交通大學 === 資訊管理研究所 === 103 === This study considers the minimization of total weighted completion time in a resource-constrained scheduling problem. A set of jobs is to be processed by a single machine with an initial level of resource provided for the jobs. Each job acquires and consumes an...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/a7mnpm |