Parallel-Machine Scheduling to Minimize Total Weighted Flow Time
碩士 === 逢甲大學 === 工業工程與系統管理學研究所 === 100 === Minimizing the total Weighted Flow Time for sequence-dependent family setup time scheduling problem on unrelated parallel machines is an NP-hard problem. When dealing with big problem in reality, it is almost impossible to find the optimize solution in reaso...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/rt2v6h |