Minimizing the makespan on a single-machine with linear deterioration consideration
碩士 === 逢甲大學 === 統計與精算所 === 95 === This paper addresses a makespan minimization scheduling problem on a single machine with linear deterioration consideration. This problem is known to be a strongly NP-hard . A branch-and-bound algorithm incorporating with several dominance and a lower bound is propo...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/62766421349436376775 |