A Branch-and-Bound Algorithm to Minimize Total Completion Time on Identical Parallel Machines for Scheduling Preemptive jobs With Release Dates
碩士 === 朝陽科技大學 === 工業工程與管理系 === 104 === The total completion time is an important performance criterion for production schedules. Reducing the total completion time can reduce the number of WIP effectively which can then reduce production costs. This study aims to investigate the identical parallel-m...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/29063764989727808237 |