| Summary: | 碩士 === 國立臺北科技大學 === 工業工程與管理研究所 === 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 results show that the frequency of the minimum project completion times through applying the priority rule LRD/LFT , which considering both factors of task duration and resource requirements, is more than that of the rank second rule LFT by 9%, which only considering the factor of task duration. However, it is well recognized that no priority rule can get the best solutions in all different settings and objectives. We come up with the synthetic priority rule , which can be systematical applied in different project environments according to different resource requirement density. When the density of the total resources usage is under 30%, we suggest α=0,β=1 to let the rule become the LFT rule. When the density of the total resources usage is more than 30%, we suggest α=1,β=1 to let the rule become LRD/LFT priority rule we proposed. The density of the total resources usage is about more than 60% and only single resource is required, we suggest α=1,β=0 to let the rule become LRD rule which is a simple rule we proposed. The selection criteria among the priority rules has never been brought up in previously researches.
|
|---|
