Approximation in stochastic scheduling

DOI10.1145/331524.331530zbMath1176.90262OpenAlexW1974114807MaRDI QIDQ3158561

Marc Uetz, Andreas S. Schulz, Rolf H. Möhring

Publication date: 25 January 2005

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/331524.331530

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Stochastic scheduling theory in operations research (90B36)

Related Items (33)

Unnamed Item ⋮ Scheduling under linear constraints ⋮ Unrelated Machine Scheduling with Stochastic Processing Times ⋮ Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines ⋮ Configuration balancing for stochastic requests ⋮ An improved greedy algorithm for stochastic online scheduling on unrelated machines ⋮ Approximation Algorithms for Stochastic and Risk-Averse Optimization ⋮ Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition ⋮ Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling ⋮ An adversarial model for scheduling with testing ⋮ Approximations to Stochastic Dynamic Programs via Information Relaxation Duality ⋮ Online stochastic optimization under time constraints ⋮ Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality ⋮ Randomized mechanism design for decentralized network scheduling ⋮ Analysis of Smith's rule in stochastic machine scheduling ⋮ Coping with Incomplete Information in Scheduling — Stochastic and Online Models ⋮ Approximation algorithms for scheduling problems with a modified total weighted tardiness objective ⋮ Reference points and approximation algorithms in multicriteria discrete optimization ⋮ Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms ⋮ On robust online scheduling algorithms ⋮ Preemptive stochastic online scheduling on two uniform machines ⋮ Hedging uncertainty: approximation algorithms for stochastic optimization problems ⋮ Risk-averse single machine scheduling: complexity and approximation ⋮ On index policies for stochastic minsum scheduling ⋮ Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms ⋮ Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines ⋮ Online Linear Optimization for Job Scheduling Under Precedence Constraints ⋮ Stochastic Load Balancing on Unrelated Machines ⋮ Randomized selection algorithm for online stochastic unrelated machines scheduling ⋮ Running Errands in Time: Approximation Algorithms for Stochastic Orienteering ⋮ A Tight 2-Approximation for Preemptive Stochastic Scheduling ⋮ Stochastic Online Scheduling Revisited ⋮ An adaptive robust optimization model for parallel machine scheduling

This page was built for publication: Approximation in stochastic scheduling