Abstract
This paper presents an efficient resource allocation algorithm, and examines its performance against a number of scheduling heuristic rules, aimed at minimizing project durations in a multiple resource-constrained environment. The algorithm has been coded in BASIC and can easily interface with available planning and scheduling software systems. Unlike other heuristic network-based algorithms, resources are allocated simultaneously to sets of activities, rather than to individual activities in a sequential manner. An experiment was conducted to study the performance of the proposed algorithm and compare its results with those generated by four different heuristic scheduling rules, including those found to have the most superior performance such as the widely used least total float rule. Thirty-one network examples adopted from the literature are analysed. The results indicate that the proposed algorithm is superior to the others. The proposed algorithm provides a reasonable trade-off between the best accur...
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.