Multifacility-Type Capacity Expansion Planning: Algorithms and Complexities
From MaRDI portal
Publication:3026697
Recommendations
- A heuristic for capacity expansion planning with multiple facility types
- A capacity expansion model with applications to multiplexing in communication networks
- Capacity expansion planning for a single facility product line
- On the optimum capacity of capacity expansion problems
- The Multiregion Dynamic Capacity Expansion Problem: An Improved Heuristic
Cited in
(15)- 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
- A multiple criteria approach to aggregate industrial capacity expansion
- A multi-stage stochastic programming approach for network capacity expansion with multiple sources of capacity
- Capacity expansion with alternative technology choices
- A computational comparison of several formulations for the multi-period incremental service facility location problem
- A heuristic for capacity expansion planning with multiple facility types
- Computational comparison of two formulations for dynamic supply chain reconfiguration with capacity expansion and contraction
- An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies
- The capacity expansion problem in the service industry
- Multi-facility capacity expansion in R&D projects
- Capacity expansion planning for a single facility product line
- The network redesign problem for access telecommunications networks
- A capacity expansion model with applications to multiplexing in communication networks
- Multidimensional approximation algorithms for capacity-expansion problems
This page was built for publication: Multifacility-Type Capacity Expansion Planning: Algorithms and Complexities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3026697)