Stochastic Online Scheduling Revisited

DOI10.1007/978-3-540-85097-7_42zbMath1168.90489OpenAlexW1589738314MaRDI QIDQ5505682

Andreas S. Schulz

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_42

Mathematics Subject Classification ID

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

Related Items (8)

Unnamed Item ⋮ Dynamic resource allocation to improve emergency department efficiency in real time ⋮ Unrelated Machine Scheduling with Stochastic Processing Times ⋮ An improved greedy algorithm for stochastic online scheduling on unrelated machines ⋮ Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling ⋮ Online scheduling for outpatient services with heterogeneous patients and physicians ⋮ On index policies for stochastic minsum scheduling ⋮ A Tight 2-Approximation for Preemptive Stochastic Scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On-line scheduling to minimize average completion time revisited.
• Approximation results in parallel machines stochastic scheduling
• The power of \(\alpha\)-points in preemptive single machine scheduling.
• The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
• Approximation Techniques for Average Completion Time Scheduling
• Single Machine Scheduling with Release Dates
• Approximation in stochastic scheduling
• Stochastic scheduling problems I — General strategies
• On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
• LP-Based Online Scheduling: From Single to Parallel Machines
• On the optimality of static priority policies in stochastic scheduling on parallel machines
• Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
• Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Scheduling Unrelated Machines by Randomized Rounding
• Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
• Stochastic Machine Scheduling with Precedence Constraints
• Models and Algorithms for Stochastic Online Scheduling
• Approximation in Preemptive Stochastic Online Scheduling
• Scheduling with Random Service Times

This page was built for publication: Stochastic Online Scheduling Revisited