Design of Efficient Heuristic Algorithms for Solving Scheduling Problems with Multiple Mold Constraints
碩士 === 義守大學 === 資訊管理學系碩士班 === 98 === The computational complexity for finding optimal solutions of scheduling problems is usually NP-complete. Finding heuristic algorithms to get a good trade-off between spent time and scheduling optimality has thus attracting much attention in recent years. In this...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/32984846503887200676 |