Abstract
The existence of limited resources and precedence relations between activities makes project scheduling a difficult task. In this paper, the multimode resource-constrained project scheduling problem (MRCPSP) as one of the important project scheduling problems is focused. In this regard, a genetic algorithm (GA) is proposed for solving the multimode resource-constrained project scheduling problem (MRCPSP) improved by a new local search method. The Activity Mode List (AML) is used as encoding and the multimode serial schedule generation scheme (MSSGS) is employed as the decoding procedure. The aim of the suggested local search is maximum use of existed nonrenewable resources of the project such that its makespan is decreased. For this purpose, the local search procedure allocates the unused nonrenewable resources of each feasible solution to the activities with lower total float. Comparing results of the proposed method with other ones using the set J20 in Project Scheduling Problem Library (PSPLIB) validates the effectiveness of the proposed algorithm to solve the MRCPSP.
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.
