A Tight 2-Approximation for Preemptive Stochastic Scheduling.
Nicole MegowTjark VredeveldPublished in: Math. Oper. Res. (2014)
Keyphrases
- scheduling algorithm
- scheduling problem
- lower bound
- discrete random variables
- approximation schemes
- upper bound
- single machine
- monte carlo sampling
- stage stochastic programs
- response time
- resource allocation
- monte carlo
- np hard
- error bounds
- parallel machines
- information systems
- real time database systems
- processing times
- approximation algorithms
- closed form
- worst case
- flowshop
- stochastic processes
- approximation error
- batch processing
- dynamic scheduling
- optimal solution
- power consumption