Abstract
An alternative heuristic method for scheduling repetitive projects in which resources are limited and activities may be executed with multiple modes of resource demands associated with different durations is proposed. Unlike general heuristic methods that separately analyze each competing activity and schedule only one at a time, the proposed heuristic algorithm ranks possible combinations of activities every time and simultaneously schedules all activities in the selected combination leading to minimal project duration. All alternative combinations of activities in consideration of resource constraints, multiple modes and characteristics of the repetitive projects are determined through a permutation tree‐based procedure. The heuristic method is implemented based on the corresponding framework. An example is presented to demonstrate the efficiency of the proposed heuristic method. The study is expected to provide an efficient heuristic methodology for solving the project scheduling problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
