Single-machine scheduling to minimize the total weighted completion time with release times and two-agents
碩士 === 逢甲大學 === 應用統計研究所 === 99 === In many management situations, multiple agents pursuing different objectives compete on the usage of a common processing resource. In this paper, we study a single-machine scheduling problem with release time where the objective is to minimize the total weighted...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/52787846317466737214 |