A Comparison of Meta-heuristics Algorithms for Resource-Constrained Project Scheduling
碩士 === 國立交通大學 === 工業工程與管理系所 === 95 === Resource-constrained project scheduling is a NP-hard problem. In the last few decades, several meta-heuristics algorithms have been proposed to solve the problem. The algorithm proposed by Debels et al. (2006) is by far the most leading one. To develop a better...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/99638941796910735221 |