A Better Lower Bound for On-Line Scheduling.
Yair BartalHoward J. KarloffYuval RabaniPublished in: Inf. Process. Lett. (1994)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- scheduling problem
- objective function
- lower and upper bounds
- scheduling algorithm
- np hard
- precedence constraints
- optimal solution
- worst case
- sufficiently accurate
- round robin
- linear programming relaxation
- resource allocation
- dynamic scheduling
- upper and lower bounds
- parallel processors
- batch processing
- neural network
- preventive maintenance
- wafer fabrication
- lower bounding
- real time database systems
- vc dimension
- sample complexity
- column generation
- search algorithm