Strategic Safety-Stock Placement in Supply Chains with Capacity Constraints
Name
Capacityconstraints December 2015 complete R1 final-Stephen-Graves.pdf
Size
427.06 KB
Format
Adobe PDF
Checksum (MD5)
ef4f399c7efb9ec96d5b923e6b9eb871
Author(s)
Graves, Stephen C
Schoenmeyr, Tor Ivar
Date Issued
June 2016
Journal
Manufacturing & Service Operations Management
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Citation
Graves, Stephen C., and Schoenmeyr, Tor. “Strategic Safety-Stock Placement in Supply Chains with Capacity Constraints.” Manufacturing & Service Operations Management 18, 3 (July 2016): 445–460 © 2017 Institute for Operations Research and the Management Sciences (INFORMS)
Version
Author's final manuscript
Abstract
We generalize the guaranteed-service (GS) model for safety-stock placement in supply chains to include capacity constraints. We first examine the guaranteed-service model for a capacitated single-stage system with bounded demand. We characterize the optimal inventory policy, which depends on the entire demand history. Due to this complexity, we develop a heuristic, namely a constant base-stock policy with censored ordering. This is an order-up-to policy but with its replenishment orders censored by the capacity constraint. We refer to this heuristic as the modified constant base-stock policy (MCBS). We use a numerical experiment to compare the performance of the heuristic policy to the optimal policy. We find that the performance of the heuristic relative to the optimal policy improves with a tighter capacity constraint. We also observe that the performance of the heuristic itself can sometimes be improved by tightening the capacity constraint. We then use the results for a single-stage system to model a multistage serial system that operates with a constant base-stock policy with censored ordering, i.e., an MCBS policy. We show how to adapt the existing dynamic programming algorithm for the unconstrained case to solve for the safety-stock locations and base-stock levels in a capacitated serial system. We describe how to extend this model to other supply chain topologies. We report on numerical tests for serial systems and find that the best MCBS policy in a capacitated system can outperform the best constant base-stock policy in an identical but uncapacitated system.
MIT Department
Sloan School of Management
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1287/msom.2016.0577
