A new average case analysis for completion time scheduling
From MaRDI portal
Publication:5900516
DOI10.1145/1120582.1120585zbMath1315.90017OpenAlexW2052294974MaRDI QIDQ5900516
Angelika Steger, Thomas Schickinger, Mark Scharbrodt
Publication date: 21 December 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1120582.1120585
Analysis of algorithms (68W40) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (8)
Evaluating the quality of online optimization algorithms by discrete event simulation ⋮ Unrelated Machine Scheduling with Stochastic Processing Times ⋮ The expected asymptotical ratio for preemptive stochastic online problem ⋮ Average-case competitive analyses for one-way trading ⋮ An improved greedy algorithm for stochastic online scheduling on unrelated machines ⋮ Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality ⋮ Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison ⋮ On robust online scheduling algorithms
This page was built for publication: A new average case analysis for completion time scheduling
