Abstract
In this article* we study the stochastic resource-constrained project scheduling problem or SRCPSP, where project activities have stochastic durations. A solution is a scheduling policy, and we propose a new class of policies that is a superset of most of the existing classes that are available in the literature. A policy in this new class makes a number of a-priori decisions in a pre-processing phase while the remaining scheduling decisions are made on-line. A two-phase local-search algorithm is proposed to find high-quality policies within the class. Our computational results indicate that the proposed procedure outperforms all existing algorithms for large instances.
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.
