Polynomial approximation algorithms for solving resource-constrained project scheduling problem.
Ivan A. RykovPublished in: Electron. Notes Discret. Math. (2006)
Keyphrases
- resource constrained project scheduling problem
- approximation algorithms
- project scheduling
- np hard
- precedence relations
- resource constraints
- special case
- vertex cover
- minimum cost
- ant colony algorithm
- worst case
- primal dual
- approximation ratio
- constant factor
- artificial bee colony
- harmony search
- polynomial time approximation
- np complete
- scheduling problem
- optimal solution