Quasi-PTAS for Scheduling with Precedences using LP Hierarchies.
Shashwat GargPublished in: CoRR (2017)
Keyphrases
- precedence constraints
- approximation algorithms
- scheduling problem
- linear programming
- np hard
- scheduling algorithm
- resource allocation
- approximation schemes
- partial order
- round robin
- parallel processors
- linear program
- branch and bound algorithm
- dynamic scheduling
- parallel machines
- primal dual
- hierarchical structure
- flexible manufacturing systems
- polynomial time approximation
- genetic algorithm
- multiple objectives
- special case
- objective function
- distributed systems
- dynamic programming
- simplex method
- computational complexity
- neural network
- asset liability management