On the Value of Adaptive Solutions to Stochastic Scheduling Problems

DOI10.1287/MOOR.20.1.65MaRDI QIDQ4835386zbMATH OpenOpenAlexFDO

Authors R. W. Owen, Kevin D. Glazebrook

Publication date 14 June 1995

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.20.1.65

zbMATH Keywords

stochastic schedulingtwo-armed banditunknown system parametersjob scheduling model with breakdowns

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Markov renewal processes, semi-Markov processes (60K15) Stochastic systems in control theory (general) (93E03)

Recommendations

• Sensitivity Analysis for Stochastic Scheduling Problems
• scientific article; zbMATH DE number 96059
• Stochastic scheduling problems I — General strategies
• Bounds on optimal values in stochastic scheduling
• Restricted Adaptivity in Stochastic Scheduling

Cited in

(5)

• A Bayesian approach to the triage problem with imperfect classification
• Adaptive uncertainty resolution in Bayesian combinatorial optimization problems
• An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem
• Single machine scheduling when processing times are correlated normal random variables
• Stochastic scheduling and forwards induction

This page was built for publication: On the Value of Adaptive Solutions to Stochastic Scheduling Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835386)