Fault tolerant scheduling of tasks of two sizes under resource augmentation

DOI10.1007/S10951-017-0541-1zbMath1386.90060OpenAlexW2754556648MaRDI QIDQ1702666

Prudence W. H. Wong, Dariusz R. Kowalski, Elli Zavou

Publication date: 28 February 2018

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-017-0541-1

zbMATH Keywords

schedulingcompetitive analysisonline algorithmsresource augmentationadversarial failurestask sizes

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Measuring the impact of adversarial errors on packet scheduling strategies
• Single machine flow-time scheduling with a single breakdown
• Machine scheduling with availability constraints
• Optimal parallel machines scheduling with availability constraints
• Online parallel scheduling of non-uniform tasks: trading failures for energy
• Online bin packing with resource augmentation
• Bounds for Scheduling Jobs on Grid Processors
• Meeting Deadlines: How Much Speed Suffices?
• Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts
• Online Packet Scheduling Under Adversarial Jamming
• Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data

This page was built for publication: Fault tolerant scheduling of tasks of two sizes under resource augmentation