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 |
| Summary: | 碩士 === 逢甲大學 === 工業工程與系統管理學研究所 === 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 period of time. This study will first use apparent tardiness cost with setup (ATCS) procedure to generate a fast solution, then use simulated annealing method and combined heuristic method to improve the fast solution in order to find the optimal solution or approximate optimal solution in reasonable period of time for business use. In order to evaluate the efficiency and quality of the method developed by this study, the method will be tested on a set of random generated probleosm and compare the results to a Random Descent Heuristic(RDH) method.
|
|---|