Uniprocessor Scheduling Under Precedence Constraints.
Leonardo MangerucaAlberto FerrariAlberto L. Sangiovanni-VincentelliPublished in: IEEE Real Time Technology and Applications Symposium (2006)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- parallel machines
- release dates
- parallel processors
- maximum lateness
- approximation algorithms
- setup times
- vertex cover
- single machine scheduling problem
- partially ordered
- global constraints
- sequence dependent setup times
- partial order
- series parallel
- single machine
- partially ordered sets
- tabu search
- np hard
- lower bound
- unit length
- job shop scheduling problem
- identical machines
- flowshop
- branch and bound
- multi dimensional
- upper bound
- special case
- total tardiness