A hybrid Algorithm for Minimizing the Total Tardiness for Sequence-Dependent Family Setup Time Scheduling Problem on Unrelated Parallel Machines
碩士 === 逢甲大學 === 工業工程與系統管理學研究所 === 96 === Minimizing the total tardiness 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 reasonable perio...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/21964256911180561415 |