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

DOI10.1287/MOOR.8.4.525MaRDI QIDQ3315284zbMATH OpenOpenAlexWikidataFDO

Authors

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

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

Recommendations

• scientific article; zbMATH DE number 4099043
• Stochastic programming approaches to stochastic scheduling
• scientific article; zbMATH DE number 4053339
• scientific article; zbMATH DE number 4099020
• STOCHASTIC INTEGER PROGRAMMING BY DYNAMIC PROGRAMMING

Cited in

(22)

• On a new class of bilevel programming problems and its use for reformulating mixed integer problems
• Solving hierarchical stochastic programs: application to the maritime fleet renewal problem
• The matroidal knapsack: A class of (often) well-solvable problems
• Bounds and asymptotic results for the uniform parallel processor weighted flow time problem
• STOCHASTIC INTEGER PROGRAMMING BY DYNAMIC PROGRAMMING
• scientific article; zbMATH DE number 4053339 (Why is no real title available?)
• The double exponential runtime is tight for 2-stage stochastic ILPs
• Stochastic on-line knapsack problems
• Tight lower bounds for block-structured integer programs
• scientific article; zbMATH DE number 4099043 (Why is no real title available?)
• Tight lower bounds for block-structured integer programs
• An appraisal of computational complexity for operations researchers
• Stochastic programming approaches to stochastic scheduling
• scientific article; zbMATH DE number 4099020 (Why is no real title available?)
• The double exponential runtime is tight for 2-stage stochastic ILPs
• On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints
• New directions in scheduling theory
• Models for robust tactical planning in multi-stage production systems with uncertain demands
• Distribution-free bounds on the expectation of the maximum with scheduling applications
• Multi-constrained matroidal knapsack problems
• Update on the asymptotic optimality of LPT
• Computational complexity of stochastic programming problems

This page was built for publication: Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems

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