Abstract
This paper studies the multi-project scheduling problem which involves multiple projects with different importance weight; with predefined assigned due dates; with activities that have uncertain durations; and with renewable resources that are constrained. The resource sharing policy is applied to share the resources among projects. Due to the environmental rapid changes and also the uniqueness of projects, the probability distribution function of uncertain durations cannot be estimated with confidence. Besides, the multi-project scheduling problem with its large scale investment dictates a conservative approach to deal with the existing uncertainty. Therefore, the Robust Resource-Constrained Multi-Project Scheduling Problem (RRCMPSp ) is studied in this paper while the maximum total weighted tardiness of the projects should be minimized. A scenario-relaxation algorithm is implemented which results in optimal solutions for the RRCMPSp . The aim is to find an optimal structure containing all the projects in such a way that it transfers the resources between the activities based on the resource sharing policy while the maximum weighted differences between the projects finish times and their assigned due dates will be minimum.
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.
