Heuristic algorithm for single resource constrained project scheduling problem based on the dynamic programming

We introduce a heuristic method for the single resource constrained project scheduling problem, based on the dynamic programming solution of the knapsack problem.This method schedules projects with one Kit DIY type of resources, in the non-preemptive case: once started an activity is not interrupted and runs to completion.We compare the implementation of this method with well-known heuristic scheduling Swing Arm method, called Minimum Slack First (known also as Gray-Kidd algorithm), as well as with Microsoft Project.