Preemptive online scheduling with reordering

DOI10.1137/090766139MaRDI QIDQ5894320zbMATH OpenOpenAlexFDO

Authors György Dósa, Leah Epstein

Publication date 27 October 2011

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/090766139

zbMATH Keywords

buffer managementonline algorithmsscheduling

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40)

Recommendations

• Preemptive Online Scheduling with Reordering
• Max-min online allocations with a reordering buffer
• Max-min online allocations with a reordering buffer
• The Power of Reordering for Online Minimum Makespan Scheduling
• Online minimum makespan scheduling with a buffer

Cited in

(15)

• Preemptive scheduling with finite capacity input buffers
• Online makespan scheduling with job migration on uniform machines
• Online scheduling FIFO policies with admission and push-out
• The Power of Reordering for Online Minimum Makespan Scheduling
• Online Preemptive Scheduling with Immediate Decision or Notification and Penalties
• Improved semi-online makespan scheduling with a reordering buffer
• Robust algorithms for preemptive scheduling
• Online scheduling with rejection and reordering: exact algorithms for unit size jobs
• Online makespan minimization: the power of restart
• Online Makespan Scheduling with Job Migration on Uniform Machines
• Online stochastic reordering buffer scheduling
• Preemptive Online Scheduling with Reordering
• Semi-online scheduling with non-increasing job sizes and a buffer
• Online scheduling with a buffer on related machines
• Semi-online models for cardinality constrained bin packing

This page was built for publication: Preemptive online scheduling with reordering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5894320)