Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques.
Javier MarencoAnnegret WaglerPublished in: Discret. Optim. (2009)
Keyphrases
- valid inequalities
- scheduling problem
- scheduling algorithm
- color images
- convex hull
- linear inequalities
- dynamic scheduling
- multi faceted
- sufficient conditions
- human perception
- parallel machines
- round robin
- mixed integer
- wafer fabrication
- lattice points
- cutting plane algorithm
- real time database systems
- random variables
- resource constraints
- integer programming
- manufacturing cell
- resource allocation
- facet defining inequalities