Multifacility-Type Capacity Expansion Planning: Algorithms and Complexities
From MaRDI portal
Publication:3026697
DOI10.1287/opre.35.2.249zbMath0624.90023OpenAlexW2074427403MaRDI QIDQ3026697
Publication date: 1987
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.35.2.249
Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)
Related Items (9)
Capacity expansion with alternative technology choices ⋮ Computational comparison of two formulations for dynamic supply chain reconfiguration with capacity expansion and contraction ⋮ A computational comparison of several formulations for the multi-period incremental service facility location problem ⋮ An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies ⋮ Multi-facility capacity expansion in R&D projects ⋮ The network redesign problem for access telecommunications networks ⋮ Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning ⋮ A model for the optimal timing and sizing of capacity increments for single-location facilities ⋮ The capacity expansion problem in the service industry
This page was built for publication: Multifacility-Type Capacity Expansion Planning: Algorithms and Complexities