Minimizing total completion time on unrelated parallel machine with machine eligibility restriction
碩士 === 中原大學 === 工業工程研究所 === 95 === This article considers the problems of scheduling a given set of independent jobs on unrelated parallel machines to minimize the total completion time. The problem is known to be NP-Hard. Efficient heuristic and branch and bound algorithms are developed. Heuristic...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/87908159816411849779 |