Minimizing Total Flowtime with Arrival Time in Batches on Identical Parallel Machines
碩士 === 中原大學 === 工業工程研究所 === 95 === This paper considers the identical parallel machines problem, where jobs arrive in batches. The objective is to minimize the total completion time. Since the single machine problem with job arrival time is known to be NP-hard, therefore the problem is NP-hard in th...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/02292190095830243568 |