The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure

We present a heuristic procedure for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) applied within the selected mode. This problem is a natural combination of the time/cost trade-off problem and the resource constrained project scheduling problem. The objective is to determine each activity's start (finish) time, mode and duration so that the total project cost is minimized. Total project cost is the sum of all activity costs and the penalty cost for completing the project beyond its due date. We introduce a multi-pass algorithm. We report computational results with a set of 100 test problems and demonstrate the efficacy of the proposed heuristic procedure.