Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra.
Ramakrishna UpadrastaAlbert CohenPublished in: POPL (2013)
Keyphrases
- line drawings
- convex hull
- convex sets
- scheduling problem
- scheduling algorithm
- round robin
- resource allocation
- dynamic scheduling
- cover inequalities
- scheduling strategy
- resource constraints
- fixed point
- special case
- flexible manufacturing systems
- continuous variables
- load balancing
- case study
- preventive maintenance
- learning algorithm
- convex polyhedra
- data sets