Approximation in stochastic scheduling
From MaRDI portal
Recommendations
Cited in
(42)- Reference points and approximation algorithms in multicriteria discrete optimization
- Online stochastic optimization under time constraints
- Randomized selection algorithm for online stochastic unrelated machines scheduling
- An adaptive robust optimization model for parallel machine scheduling
- An adversarial model for scheduling with testing
- Risk-averse single machine scheduling: complexity and approximation
- On index policies for stochastic minsum scheduling
- Analysis of Smith's rule in stochastic machine scheduling
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines
- An improved greedy algorithm for stochastic online scheduling on unrelated machines
- Online Linear Optimization for Job Scheduling Under Precedence Constraints
- Unrelated machine scheduling with stochastic processing times
- Scheduling under linear constraints
- Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling
- Approximation algorithms for stochastic and risk-averse optimization
- scientific article; zbMATH DE number 1418273 (Why is no real title available?)
- Stochastic load balancing on unrelated machines
- Greed works -- online algorithms for unrelated machine stochastic scheduling
- Approximations to stochastic dynamic programs via information relaxation duality
- Static routing in stochastic scheduling: performance guarantees and asymptotic optimality
- Randomized mechanism design for decentralized network scheduling
- scientific article; zbMATH DE number 7112744 (Why is no real title available?)
- Improvements and generalizations of stochastic knapsack and Markovian bandits approximation algorithms
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
- A tight 2-approximation for preemptive stochastic scheduling
- Coping with Incomplete Information in Scheduling — Stochastic and Online Models
- On robust online scheduling algorithms
- Stochastic Online Scheduling Revisited
- Configuration balancing for stochastic requests
- Fifty years of research in scheduling -- theory and applications
- Scheduling with testing: competitive algorithms for minimizing the total weighted completion time in the adversarial model
- Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
- Configuration balancing for stochastic requests
- Sequencing stochastic jobs with a single sample
- Stochastic load balancing with machine reservations
- Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
- Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria
- Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Preemptive stochastic online scheduling on two uniform machines
This page was built for publication: Approximation in stochastic scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3158561)
