Optimal ordering of independent tests with precedence constraints.
Daniel BerendRonen I. BrafmanShimon CohenSolomon Eyal ShimonyShira ZuckerPublished in: Discret. Appl. Math. (2014)
Keyphrases
- precedence constraints
- scheduling problem
- partial order
- branch and bound algorithm
- vertex cover
- optimal solution
- precedence relations
- parallel processors
- dynamic programming
- partially ordered
- single machine scheduling problem
- setup times
- series parallel
- release dates
- sequence dependent setup times
- maximum lateness
- worst case
- single machine
- global constraints
- branch and bound