Random-Based Scheduling: New Approximations and LP Lower Bounds.
Andreas S. SchulzMartin SkutellaPublished in: RANDOM (1997)
Keyphrases
- lower bound
- objective function
- np hard
- upper bound
- scheduling problem
- optimal solution
- linear programming
- linear programming relaxation
- linear program
- branch and bound
- random instances
- branch and bound algorithm
- scheduling algorithm
- round robin
- optimal cost
- feasible solution
- parallel machines
- upper and lower bounds
- closed form
- single machine
- resource allocation
- sample complexity
- primal dual
- computational complexity
- parallel processors
- data structure