Single Machine Scheduling with Precedence Constraints of Dimension 2.
George SteinerPublished in: Math. Oper. Res. (1984)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- parallel machines
- precedence relations
- approximation algorithms
- release dates
- partial order
- vertex cover
- parallel processors
- partially ordered
- sequence dependent setup times
- global constraints
- maximum lateness
- single machine scheduling problem
- series parallel
- unit length
- setup times
- np hard
- lower bound
- branch and bound
- special case
- single machine
- tabu search
- optimal solution