Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem.
Christoph AmbühlMonaldo MastrolilliPublished in: Algorithmica (2009)
Keyphrases
- vertex cover
- single machine
- scheduling problem
- precedence constraints
- release dates
- maximum lateness
- sequence dependent setup times
- minimize total
- processing times
- single machine scheduling problem
- approximation algorithms
- release times
- np hard
- scheduling jobs
- flowshop
- weighted tardiness
- parallel machines
- identical machines
- tabu search
- job shop
- branch and bound algorithm
- deteriorating jobs
- competitive ratio
- partial order
- job shop scheduling problem
- state space