Abstract
This paper proposes a genetic algorithm to solve resource constrained project scheduling problem, in which resources are optimally allocated to tasks. Resources are renewable. In RCPSP each activity is executing in single mode. This work employed genetic algorithm to schedule project task to minimize makespan respect to resource constraint and precedence constraint. The Schedule Generation Scheme was used to decode project plan. The approach was tested on a set of standard problem obtained from Project Scheduling Problem Library (PSLIB) and algorithm given in this paper was compared with the existing optimization algorithm, the result reveals that the algorithm is effective for the RCPSP.
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.
