On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs.
Kevin D. GlazebrookJ. C. GittinsPublished in: Oper. Res. (1981)
Keyphrases
- precedence relations
- precedence constraints
- processing times
- scheduling problem
- branch and bound algorithm
- approximation algorithms
- single machine scheduling problem
- resource constrained project scheduling problem
- dynamic programming
- partially ordered
- global constraints
- partial order
- average cost
- sequence dependent setup times
- markov decision processes
- setup times
- release dates
- lower bound
- special case
- upper bound
- search space