The Resource Constrained Project Scheduling Problem (RCPSP) consists of minimizing the project duration under fixed resource constraint. When the resources are available in plenty the only determining factor for the project duration is the duration of each activity and more specifically the duration of activities in the Critical Path. This non constrained project scheduling problem is the standard Critical Path analysis.But when the resources are fixed, the scheduling and sequencing of activity becomes more important. TheRCPSP has been shown to be NP hard. Some optimal algorithms exist and the most efficient ones are basedon Branch and Bound approach but for projects with more activities/tasks they become very timeconsuming. Heuristic Approaches have become popular over time