Quasi-PTAS for Scheduling with Precedences using LP Hierarchies.
Shashwat GargPublished in: ICALP (2018)
Keyphrases
- precedence constraints
- approximation algorithms
- scheduling problem
- np hard
- linear programming
- branch and bound algorithm
- scheduling algorithm
- approximation schemes
- polynomial time approximation
- linear program
- partial order
- parallel machines
- primal dual
- parallel processors
- single machine scheduling problem
- flexible manufacturing systems
- global constraints
- worst case
- special case
- resource constraints
- optimal solution
- resource utilization
- integer programming
- resource allocation
- round robin
- real time database systems
- dynamic programming
- batch processing
- computational grids
- evolutionary algorithm