Semi-online preemptive scheduling: study of special cases

DOI10.1007/978-3-642-14403-5_2MaRDI QIDQ3583568zbMATH OpenOpenAlexFDO

Authors Tomáš Ebenlendr

Publication date 17 August 2010

Published in Parallel Processing and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14403-5_2

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

• Semi-online preemptive scheduling: one algorithm for all variants
• Semi-online preemptive scheduling: one algorithm for all variants
• Optimal preemptive semi-online scheduling on two uniform processors
• Semi-online scheduling problems on a small number of machines
• STACS 2004

Cited in

(2)

• Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
• Algorithms and Computation

This page was built for publication: Semi-online preemptive scheduling: study of special cases

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