Scheduling Unrelated Parallel-Machine to Minimize Total Weighted Tardiness
碩士 === 朝陽科技大學 === 工業工程與管理系碩士班 === 89 === The unrelated parallel-machine scheduling problem can be stated as follows. There are n independent jobs and m different machines. Each job needs to be scheduled exactly on one machine, and every machine can process at most one job at a time. We assume that t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/46452156118203015871 |