Pages that link to "Item:Q3158561"
From MaRDI portal
The following pages link to Approximation in stochastic scheduling (Q3158561):
Displaying 32 items.
- Scheduling under linear constraints (Q323163) (← links)
- On robust online scheduling algorithms (Q539452) (← links)
- Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines (Q763104) (← links)
- Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition (Q904957) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- Preemptive stochastic online scheduling on two uniform machines (Q976122) (← links)
- Reference points and approximation algorithms in multicriteria discrete optimization (Q1753504) (← links)
- Online stochastic optimization under time constraints (Q1958625) (← links)
- Randomized selection algorithm for online stochastic unrelated machines scheduling (Q2082193) (← links)
- An adaptive robust optimization model for parallel machine scheduling (Q2106719) (← links)
- An adversarial model for scheduling with testing (Q2211361) (← links)
- Risk-averse single machine scheduling: complexity and approximation (Q2286434) (← links)
- On index policies for stochastic minsum scheduling (Q2294301) (← links)
- Analysis of Smith's rule in stochastic machine scheduling (Q2450731) (← links)
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective (Q2465959) (← links)
- Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
- Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines (Q2664447) (← links)
- An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
- Online Linear Optimization for Job Scheduling Under Precedence Constraints (Q2835641) (← links)
- Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
- (Q3304142) (← links)
- Approximation Algorithms for Stochastic and Risk-Averse Optimization (Q4601213) (← links)
- Stochastic Load Balancing on Unrelated Machines (Q4991668) (← links)
- Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
- Approximations to Stochastic Dynamic Programs via Information Relaxation Duality (Q5126622) (← links)
- Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Q5131543) (← links)
- Randomized mechanism design for decentralized network scheduling (Q5135252) (← links)
- Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (Q5219671) (← links)
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015) (← links)
- A Tight 2-Approximation for Preemptive Stochastic Scheduling (Q5247621) (← links)
- Coping with Incomplete Information in Scheduling — Stochastic and Online Models (Q5391870) (← links)
- Stochastic Online Scheduling Revisited (Q5505682) (← links)
