On robust online scheduling algorithms

DOI10.1007/s10951-009-0115-yzbMath1213.90117OpenAlexW2050990601MaRDI QIDQ539452

Michael Gatto, Peter Widmayer

Publication date: 30 May 2011

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

Full work available at URL: http://hdl.handle.net/20.500.11850/34605

zbMATH Keywords

robustnessschedulingperturbationonlineGraham's algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (2)

A survey on makespan minimization in semi-online environments ⋮ Robust optimization in the presence of uncertainty: a generic approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sensitivity bounds for machine scheduling with uncertain communication delays
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• Sensitivity analysis of list scheduling heuristics
• Robust discrete optimization and its applications
• On-line scheduling revisited
• Robust optimization-methodology and applications
• An exact algorithm for the robust shortest path problem with interval data
• Approximation in stochastic scheduling
• On randomized online scheduling
• Parallel Machine Scheduling with Uncertain Communication Delays
• Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
• Models and Algorithms for Stochastic Online Scheduling
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• A new average case analysis for completion time scheduling
• Sensitivity analysis for scheduling problems
• Sensitivity analysis of scheduling algorithms

This page was built for publication: On robust online scheduling algorithms