Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems

DOI10.1287/moor.8.4.525zbMath0532.90078OpenAlexW2122788717WikidataQ92413664 ScholiaQ92413664MaRDI QIDQ3315284

No author found.

Publication date: 1983

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

Full work available at URL: https://ir.cwi.nl/pub/1877

zbMATH Keywords

job shop schedulingasymptotic optimalityheuristic solution methodsmultistage stochastic programsmultistage decision problemstwo-stage hierarchical scheduling

Mathematics Subject Classification ID

Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35)

Related Items

On a new class of bilevel programming problems and its use for reformulating mixed integer problems, On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints, An appraisal of computational complexity for operations researchers, Computational complexity of stochastic programming problems, The double exponential runtime is tight for 2-stage stochastic ILPs, Stochastic on-line knapsack problems, The double exponential runtime is tight for 2-stage stochastic ILPs, Distribution-free bounds on the expectation of the maximum with scheduling applications, Multi-constrained matroidal knapsack problems, Stochastic programming approaches to stochastic scheduling, Models for robust tactical planning in multi-stage production systems with uncertain demands, New directions in scheduling theory, The matroidal knapsack: A class of (often) well-solvable problems, Bounds and asymptotic results for the uniform parallel processor weighted flow time problem