Near-Optimal Sequencing with Precedence Constraints.
Leslie A. HallDavid B. ShmoysPublished in: IPCO (1990)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- parallel machines
- approximation algorithms
- vertex cover
- release dates
- single machine scheduling problem
- partial order
- setup times
- lower bound
- sequence dependent setup times
- series parallel
- global constraints
- maximum lateness
- parallel processors
- partially ordered
- unit length
- np hard
- upper bound
- partially ordered sets
- single machine
- total tardiness
- branch and bound
- release times
- search algorithm
- neural network