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 type of resources, in the non-preemptive case: once started an activity is not interrupted and ru...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Belgrade
2009-01-01
|
| Series: | Yugoslav Journal of Operations Research |
| Online Access: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2009/0354-02430902281S.pdf |
| Summary: | 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 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 method, called Minimum Slack First (known also as Gray-Kidd algorithm), as well as with Microsoft Project. |
|---|---|
| ISSN: | 0354-0243 1820-743X |