Dynamic capacity acquisition and assignment under uncertainty

DOI10.1023/B:ANOR.0000004773.66339.dfzbMath1053.90097MaRDI QIDQ1417787

Renan Garcia, Shabbir Ahmed

Publication date: 6 January 2004

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

zbMATH Keywords

decompositionbranch-and-boundstochastic integer programmingassignment problemcapacity expansion

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15)

Related Items (20)

Supply capacity acquisition and allocation with uncertain customer demands ⋮ Two-stage stochastic lot-sizing problem under cost uncertainty ⋮ A robust optimization solution to bottleneck generalized assignment problem under uncertainty ⋮ A Scalable Bounding Method for Multistage Stochastic Programs ⋮ Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems ⋮ Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems ⋮ A study of progressive hedging for stochastic integer programming ⋮ Two-stage quadratic integer programs with stochastic right-hand sides ⋮ A hierarchy of bounds for stochastic mixed-integer programs ⋮ Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs ⋮ Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs ⋮ Combining Progressive Hedging with a Frank--Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming ⋮ Integrated facility location and capacity planning under uncertainty ⋮ Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights ⋮ Asynchronous Lagrangian scenario decomposition ⋮ Strategic facility location, capacity acquisition, and technology choice decisions under demand uncertainty: robust vs. non-robust optimization approaches ⋮ Simple dynamic location problem with uncertainty: a primal-dual heuristic approach ⋮ The million-variable ``march for stochastic combinatorial optimization ⋮ A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables ⋮ A review on strategic capacity planning for the semiconductor manufacturing industry

This page was built for publication: Dynamic capacity acquisition and assignment under uncertainty