Computational comparison of two formulations for dynamic supply chain reconfiguration with capacity expansion and contraction

DOI10.1016/J.COR.2013.04.011zbMath1348.90141OpenAlexW2052911926MaRDI QIDQ336520

Xue Han, Chaehwa Lee, Wilbert E. Wilhelm

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.04.011

zbMATH Keywords

capacity expansionmixed integer programming (MIP)capacity contractiondynamic supply chain reconfiguration (DSCR)supply chain design

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)

Related Items (7)

Capacity management in public service facility networks: a model, computational tests and a case study ⋮ Location and reorganization problems: the Calabrian health care system case ⋮ Integrated strategic and tactical supply chain planning with price-sensitive demands ⋮ Dynamic location of modular manufacturing facilities with relocation of individual modules ⋮ Supply chain network design with financial considerations: a comprehensive review ⋮ Integrated facility location and capacity planning under uncertainty ⋮ Multi-period capacitated facility location under delayed demand satisfaction

Cites Work

• Unnamed Item
• Facility location models for distribution system design
• Facility location and supply chain management. A review
• Budget constrained location problem with opening and closing of facilities.
• A multiperiod two-echelon multicommodity capacitated plant location problem
• The dynamic relocation and phase-out of a hybrid two-echelon plant/warehousing facility: A multiple objective approach
• A dynamic distribution model for combat logistics.
• An inventory-location model: Formulation, solution algorithm and computational results
• Dynamic supply chain design with inventory
• Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
• Multifacility-Type Capacity Expansion Planning: Algorithms and Complexities
• The Multiregion Dynamic Capacity Expansion Problem, Part I
• The Multiregion Dynamic Capacity Expansion Problem, Part II
• A Dual-Based Procedure for Dynamic Facility Location
• An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
• Multicommodity Distribution System Design by Benders Decomposition
• The Multiperiod Location-Allocation Problem with Relocation of Facilities
• Multi-period international facilities location: An algorithm and application
• Capacity planning and warehouse location in supply chains with uncertain demands
• Solving the dynamic facility location problem
• An algorithm for the capacitated, multi-commodity multi-period facility location problem.

This page was built for publication: Computational comparison of two formulations for dynamic supply chain reconfiguration with capacity expansion and contraction