Optimal match-up strategies in stochastic scheduling
From MaRDI portal
Publication:1346690
DOI10.1016/0166-218X(94)00098-XzbMath0819.90042OpenAlexW1980682308WikidataQ126743488 ScholiaQ126743488MaRDI QIDQ1346690
John R. Birge, Michael A. H. Dempster
Publication date: 10 April 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(94)00098-x
Related Items (4)
Optimal match-up strategies in stochastic scheduling ⋮ Stability in multistage stochastic programming ⋮ Models and model value in stochastic programming ⋮ Stochastic programming approaches to stochastic scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonanticipativity in stochastic programming
- Assessing the effects of machine breakdowns in stochastic scheduling
- Optimal match-up strategies in stochastic scheduling
- Deterministic and stochastic optimization problems of bolza type in discrete time
- Scheduling stochastic jobs on a single machine subject to breakdowns
- On Nonpreemptive Policies for Stochastic Single-Machine Scheduling with Breakdowns
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- Evaluating the effects of machine breakdowns in stochastic scheduling problems
- On stochastic programming ii: dynamic problems under risk∗
- Scheduling Jobs Subject to Nonhomogeneous Poisson Shocks
- A Review of Production Scheduling
- The value of the stochastic solution in stochastic linear programs with fixed recourse
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
- Turnpike Theory
- On general routing problems
- Single-machine scheduling subject to stochastic breakdowns
This page was built for publication: Optimal match-up strategies in stochastic scheduling
