Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem.
Christoph AmbühlMonaldo MastrolilliPublished in: ESA (2006)
Keyphrases
- vertex cover
- single machine
- precedence constraints
- scheduling problem
- release dates
- maximum lateness
- minimize total
- sequence dependent setup times
- single machine scheduling problem
- processing times
- scheduling jobs
- release times
- approximation algorithms
- np hard
- weighted tardiness
- parallel machines
- flowshop
- identical machines
- tabu search
- deteriorating jobs
- partial order
- branch and bound algorithm
- completion times
- competitive ratio
- planar graphs
- polynomial time approximation
- dynamic programming
- job shop scheduling problem
- job shop
- global constraints
- partially ordered
- upper bound
- lower bound
- reinforcement learning