An efficient technique for finding the shortest non-delay schedule for a resource-constrained project

This paper presents a heuristic scheduling technique to solve the resource constrained project scheduling problem (RCPSP). The technique efficiently finds the best non-delay schedule (non-delay schedules are known to yield near optimal solutions). The technique is based on J stages (J being the number of activities). At each stage i, all combinations of i activities that form: (1) non-delay (2) feasible, and (3) efficient schedules, are listed. Inferior schedules are eliminated at the end of each stage. The technique is illustrated using a detailed example, and compared to other models from the literature.