LP-Based Online Scheduling: From Single to Parallel Machines
From MaRDI portal
Recommendations
- LP-based online scheduling: From single to parallel machines
- Online LPT algorithms for parallel machines scheduling with a single server
- Online scheduling on parallel machines: a survey
- Online scheduling on bounded parallel-batch machines
- The optimal on-line parallel machine scheduling
- Online Scheduling with Hard Deadlines on Parallel Machines
- Semi-online algorithms for parallel machine scheduling problems
- Online algorithms for scheduling two parallel machines with a single server
- Approximation and Online Algorithms
- LPT online strategy for parallel-machine scheduling with kind release times
Cited in
(10)- On-line scheduling of parallel machines to minimize total completion times
- LP-based online scheduling: From single to parallel machines
- Single machine scheduling with release dates
- Almost sure asymptotic optimality for online routing and machine scheduling problems
- Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem
- Stochastic Online Scheduling Revisited
- LPT online strategy for parallel-machine scheduling with kind release times
- Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time
- Online k-server routing problems
This page was built for publication: LP-Based Online Scheduling: From Single to Parallel Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596362)