On the Value of Preemption in Scheduling

DOI10.1007/11830924_6zbMATH Open1155.90374OpenAlexW1810505368MaRDI QIDQ3595388FDOQ3595388

Authors: Gil Shallom, Yair Bartal, Stefano Leonardi, René A. Sitters 

Publication date: 28 August 2007

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11830924_6

Recommendations

• Online flow time scheduling in the presence of preemption overhead
• scientific article; zbMATH DE number 1263237
• Bounding the Power of Preemption in Randomized Scheduling
• scientific article; zbMATH DE number 2086672
• An optimal algorithm for preemptive on-line scheduling

Mathematics Subject Classification ID

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

Cited In (9)

• Title not available (Why is that?)
• Online flow time scheduling in the presence of preemption overhead
• Non-preemptive speed scaling
• Online and offline scheduling with cache-related preemption delays
• Title not available (Why is that?)
• How useful are preemptive schedules?
• On Job Scheduling with Preemption Penalties
• Title not available (Why is that?)
• Pre-scheduling

This page was built for publication: On the Value of Preemption in Scheduling

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