Approximation in Preemptive Stochastic Online Scheduling

DOI10.1007/11841036_47MaRDI QIDQ5449555zbMATH OpenOpenAlexFDO

Authors Nicole Megow, T. Vredeveld

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

Mathematics Subject Classification ID

Approximation algorithms (68W25) Analysis of algorithms (68W40) Stochastic scheduling theory in operations research (90B36)

Recommendations

• A tight 2-approximation for preemptive stochastic scheduling
• Approximation and Online Algorithms
• Preemptive stochastic online scheduling on two uniform machines
• Stochastic Online Scheduling Revisited
• scientific article; zbMATH DE number 1418273

Cited in

(19)

• OL-DEC-MDP model for multiagent online scheduling with a time-dependent probability of success
• Online scheduling for outpatient services with heterogeneous patients and physicians
• Analysis of computer job control under uncertainty
• On index policies for stochastic minsum scheduling
• Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines
• Approximation in stochastic scheduling
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
• The expected asymptotical ratio for preemptive stochastic online problem
• On-Line Scheduling of Imprecise Computations to Minimize Error
• Greed works -- online algorithms for unrelated machine stochastic scheduling
• A tight 2-approximation for preemptive stochastic scheduling
• Models and Algorithms for Stochastic Online Scheduling
• Coping with Incomplete Information in Scheduling — Stochastic and Online Models
• scientific article; zbMATH DE number 6469210 (Why is no real title available?)
• Stochastic Online Scheduling Revisited
• scientific article; zbMATH DE number 7053386 (Why is no real title available?)
• Online stochastic reservation systems
• Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition
• Preemptive stochastic online scheduling on two uniform machines

This page was built for publication: Approximation in Preemptive Stochastic Online Scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449555)