Dynamic Programming Solution of Sequencing Problems with Precedence Constraints.
Linus SchrageKenneth R. BakerPublished in: Oper. Res. (1978)
Keyphrases
- precedence constraints
- dynamic programming
- sequencing problems
- scheduling problem
- branch and bound algorithm
- lagrangian relaxation
- approximation algorithms
- vertex cover
- greedy algorithm
- single machine scheduling problem
- reinforcement learning
- parallel machines
- processing times
- parallel processors
- partially ordered
- np complete
- state space
- optimal solution