The Assignment Problems of Jobs to Machines with Bounded Inter-Machine Costs: NP-hardness, Approximation Algorithms and Their Applications to Networks
博士 === 國立清華大學 === 資訊工程學系 === 103 === In this dissertation, we investigate the assignment problem of jobs to machines with bounded inter-machine costs, which aims at minimizing the maximum cost among not only all pairs of a job and its assigned machine but also all pairs of the selected machines. The...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/6ra52n |