A new average case analysis for completion time scheduling
From MaRDI portal
Publication:5900516
DOI10.1145/1120582.1120585zbMath1315.90017MaRDI 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
68W40: Analysis of algorithms
90B36: Stochastic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality, The expected asymptotical ratio for preemptive stochastic online problem, On robust online scheduling algorithms, Average-case competitive analyses for one-way trading, Evaluating the quality of online optimization algorithms by discrete event simulation, An improved greedy algorithm for stochastic online scheduling on unrelated machines, Unrelated Machine Scheduling with Stochastic Processing Times, Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison