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: | Stanimirović Ivan, Petković Marko, Stanimirović Predrag, Ćirić Miroslav |
---|---|
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 |
Similar Items
-
An heuristic scheduling algorithm for resource-constrained project networks.
by: Marsh, Stewart Iden
Published: (2012) -
A Comparison of Meta-heuristics Algorithms for Resource-Constrained Project Scheduling
by: Fu-Teng Shi, et al.
Published: (2007) -
Application of Heuristic and Metaheuristic Algorithms in Solving Constrained Weber Problem with Feasible Region Bounded by Arcs
by: Igor Stojanović, et al.
Published: (2017-01-01) -
Exact and heuristic methods for resource constrained project scheduling problem
by: Kooli, Anis
Published: (2012) -
Heuristic in Resource-Constrained Project Scheduling --Project Characteristic Estimating Heuristic Performance
by: Huang Chih Jung, et al.
Published: (1993)