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

DOI10.1016/J.COR.2013.04.011zbMATH Open1348.90141OpenAlexW2052911926MaRDI QIDQ336520FDOQ336520

Authors: 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

Recommendations

• Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
• scientific article; zbMATH DE number 2159148
• Integrated strategic and tactical planning in a supply chain network design with a heuristic solution method
• A Dynamic Model for Facility Location in Closed-Loop Supply Chain Design
• Dynamic supply chain design with inventory

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Facility location and supply chain management. A review
• An inventory-location model: Formulation, solution algorithm and computational results
• Multicommodity Distribution System Design by Benders Decomposition
• Facility location models for distribution system design
• A Dual-Based Procedure for Dynamic Facility Location
• 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
• Facility location in supply chain design
• Budget constrained location problem with opening and closing of facilities.
• A multiperiod two-echelon multicommodity capacitated plant location problem
• Dynamic supply chain design with inventory
• Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
• An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
• Solving the dynamic facility location problem
• An algorithm for the capacitated, multi-commodity multi-period facility 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.
• Multifacility-Type Capacity Expansion Planning: Algorithms and Complexities
• The Multiregion Dynamic Capacity Expansion Problem, Part I
• The Multiregion Dynamic Capacity Expansion Problem, Part II

Cited In (9)

• Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
• The dynamic facility location problem with mobile production units: a waste recycling application
• Multi-period capacitated facility location under delayed demand satisfaction
• Integrated facility location and capacity planning under uncertainty
• Capacity management in public service facility networks: a model, computational tests and a case study
• Dynamic location of modular manufacturing facilities with relocation of individual modules
• Location and reorganization problems: the Calabrian health care system case
• Integrated strategic and tactical supply chain planning with price-sensitive demands
• Supply chain network design with financial considerations: a comprehensive review

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

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