Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints.
Monaldo MastrolilliPublished in: FSTTCS (2001)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- parallel machines
- vertex cover
- single machine scheduling problem
- parallel processors
- partial order
- release dates
- approximation algorithms
- sequence dependent setup times
- setup times
- series parallel
- partially ordered
- single machine
- maximum lateness
- np hard
- lower bound
- unit length
- partially ordered sets
- global constraints
- flowshop
- branch and bound
- search space
- genetic algorithm
- constraint satisfaction