UET-scheduling with chain-type precedence constraints.
Klaus JansenGerhard J. WoegingerZhongliang YuPublished in: Comput. Oper. Res. (1995)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- partially ordered sets
- precedence relations
- parallel machines
- release dates
- sequence dependent setup times
- parallel processors
- partially ordered
- setup times
- single machine scheduling problem
- approximation algorithms
- vertex cover
- partial order
- single machine
- global constraints
- maximum lateness
- identical machines
- np hard
- flowshop
- unit length
- series parallel
- lower bound
- scheduling algorithm
- processing times
- combinatorial optimization