A Study of Priority Rules for Resource-Constrained Project Scheduling Problems
碩士 === 國立臺北科技大學 === 工業工程與管理研究所 === 97 === Resource-Constrained Project Scheduling has been known as NP-complete combinatorial problem. In this study, we compare 7 kinds of priority rules, including two new rules we proposed, under different project networks and resource requirements. The experiment...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/6nhkw3 |