Preemptive Online Scheduling with Reordering

DOI10.1007/978-3-642-04128-0_41MaRDI QIDQ5902177zbMATH OpenOpenAlexFDO

Authors György Dósa, Leah Epstein

Publication date 29 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.6952

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

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
• Improved semi-online makespan scheduling with a reordering buffer

Cited in

(12)

• Online scheduling FIFO policies with admission and push-out
• Semi-online scheduling: a survey
• 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
• Semi-online preemptive scheduling: one algorithm for all variants
• Preemptive online scheduling with reordering
• Max-min online allocations with a reordering buffer
• Max-min online allocations with a reordering buffer
• Online scheduling with rearrangement on two related machines
• Optimal algorithms for online scheduling with bounded rearrangement at the end
• Online scheduling with a buffer on related machines

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 Q5902177)