Approximation in Preemptive Stochastic Online Scheduling
From MaRDI portal
Publication:5449555
DOI10.1007/11841036_47zbMath1131.90367OpenAlexW1503391522MaRDI QIDQ5449555
Publication date: 11 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11841036_47
Analysis of algorithms (68W40) Stochastic scheduling theory in operations research (90B36) Approximation algorithms (68W25)
Related Items (9)
The expected asymptotical ratio for preemptive stochastic online problem ⋮ Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition ⋮ Coping with Incomplete Information in Scheduling — Stochastic and Online Models ⋮ Online scheduling for outpatient services with heterogeneous patients and physicians ⋮ Analysis of computer job control under uncertainty ⋮ Preemptive stochastic online scheduling on two uniform machines ⋮ A Survey on Approximation Algorithms for Scheduling with Machine Unavailability ⋮ A Tight 2-Approximation for Preemptive Stochastic Scheduling ⋮ Stochastic Online Scheduling Revisited
This page was built for publication: Approximation in Preemptive Stochastic Online Scheduling
