Optimal match-up strategies in stochastic scheduling

Practical scheduling problems require the consideration of random events that may effect planned starting and completion times. In general, these problems are quite difficult to analyze. In a previous paper, general conditions were, however, developed for turnpike optimal strategies and the asymptot...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 57; no. 2; pp. 105 - 120
Main Authors Birge, John R., Dempster, M.A.H.
Format Journal Article Conference Proceeding
LanguageEnglish
Published Lausanne Elsevier B.V 24.02.1995
Amsterdam Elsevier
New York, NY
Subjects
Applied sciences
Exact sciences and technology
Match-up
Operational research and scientific management
Operational research. Management science
Optimality conditions
Scheduling, sequencing
Stochastic programming
Stochastic scheduling
Turnpike solutions
Optimality conditions
Stochastic scheduling
Turnpike solutions
Stochastic programming
Match-up
Optimality condition
Optimal strategy
Scheduling
Online AccessGet full text
ISSN0166-218X
1872-6771
DOI10.1016/0166-218X(94)00098-X

Cover

More Information
Summary:Practical scheduling problems require the consideration of random events that may effect planned starting and completion times. In general, these problems are quite difficult to analyze. In a previous paper, general conditions were, however, developed for turnpike optimal strategies and the asymptotic optimality of strategies that match up with a turnpike strategy. In this paper, we present detailed examples of these general models, comparisons with deterministic approaches, and discuss implications for practical scheduling.
ISSN:0166-218X
1872-6771
DOI:10.1016/0166-218X(94)00098-X