Online scheduling for sorting buffers
From MaRDI portal
Recommendations
Cited in
(19)- Logarithmic price of buffer downscaling on line metrics
- Reordering buffer management with advice
- Online and offline algorithms for the sorting buffers problem on the line metric
- Stochastic dominance and the bijective ratio of online algorithms
- Online scheduling FIFO policies with admission and push-out
- Online minimum makespan scheduling with a buffer
- On the randomized competitive ratio of reordering buffer management with non-uniform costs
- Weighted reordering buffer improved via variants of knapsack covering inequalities
- A note on sorting buffers offline
- NP-hardness of the sorting buffer problem on the uniform metric
- Online stochastic reordering buffer scheduling
- Optimal online buffer scheduling for block devices
- Online Sorting Buffers on Line
- Almost Tight Bounds for Reordering Buffer Management
- Approximation and Online Algorithms
- Dynamic scheduling of a picking robot with limited buffer and rejection: an industrial case study
- Buffer management for colored packets with deadlines
- Maximizing rides served for dial-a-ride on the uniform metric
- Exploiting locality: Approximating sorting buffers
This page was built for publication: Online scheduling for sorting buffers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411413)