IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v46y2016i1p18-32.html
   My bibliography  Save this article

PNG: Effective Inventory Control for Items with Highly Variable Demand

Author

Listed:
  • Tovey C. Bachman

    (LMI, Tysons, Virginia 22102)

  • Pamela J. Williams

    (LMI, Tysons, Virginia 22102)

  • Kristen M. Cheman

    (LMI, Tysons, Virginia 22102)

  • Jeffrey Curtis

    (Defense Logistics Agency, Fort Belvoir, Virginia 22060)

  • Robert Carroll

    (Office of Secretary of Defense, Washington, DC 20301)

Abstract

LMI developed the PNG inventory control solution to manage inventory items with infrequent demand (i.e., isolated spikes in demand) as well as items with frequent, highly variable demand. Such items account for the majority of hardware stocked at the U.S. Defense Logistics Agency (DLA). The forecasting of demand for these items—no matter how sophisticated the forecasting method—had resulted in years of problems for DLA: excess inventory for some items, backorders for others, and excessive buyer workload. The implementation of PNG, a software package that consists of two inventory solutions, Peak Policy and Next Gen, allowed DLA to shift from trying to forecast each item individually to using a portfolio or risk-management approach to inventory control. Since DLA implemented PNG in January 2013, the agency has achieved its inventory-related goals for better customer service and reduced buyer workload, has experienced no inventory increase, and has saved nearly $400 million per year.

Suggested Citation

  • Tovey C. Bachman & Pamela J. Williams & Kristen M. Cheman & Jeffrey Curtis & Robert Carroll, 2016. "PNG: Effective Inventory Control for Items with Highly Variable Demand," Interfaces, INFORMS, vol. 46(1), pages 18-32, February.
    • Handle: RePEc:inm:orinte:v:46:y:2016:i:1:p:18-32
    DOI: 10.1287/inte.2015.0829
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.2015.0829
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2015.0829?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Arthur F. Veinott, Jr. & Harvey M. Wagner, 1965. "Computing Optimal (s, S) Inventory Policies," Management Science, INFORMS, vol. 11(5), pages 525-552, March.
    2. Izzet Sahin, 1979. "On the Stationary Analysis of Continuous Review ( s , S ) Inventory Systems with Constant Lead Times," Operations Research, INFORMS, vol. 27(4), pages 717-729, August.
    3. Izzet Sahin, 1982. "On the Objective Function Behavior in ( s , S ) Inventory Models," Operations Research, INFORMS, vol. 30(4), pages 709-724, August.
    4. Yu-Sheng Zheng & A. Federgruen, 1991. "Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy," Operations Research, INFORMS, vol. 39(4), pages 654-665, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Daniel Y. Mo & Stephen C. H. Ng & David Tai, 2019. "Revamping NetApp’s Service Parts Operations by Process Optimization," Service Science, INFORMS, vol. 49(6), pages 407-421, November.
    2. John P. Saldanha & Bradley S. Price & Douglas J. Thomas, 2023. "A nonparametric approach for setting safety stock levels," Production and Operations Management, Production and Operations Management Society, vol. 32(4), pages 1150-1168, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiang, Mengyuan & Rossi, Roberto & Martin-Barragan, Belen & Tarim, S. Armagan, 2018. "Computing non-stationary (s, S) policies using mixed integer linear programming," European Journal of Operational Research, Elsevier, vol. 271(2), pages 490-500.
    2. Sandun C. Perera & Suresh P. Sethi, 2023. "A survey of stochastic inventory models with fixed costs: Optimality of (s, S) and (s, S)‐type policies—Continuous‐time case," Production and Operations Management, Production and Operations Management Society, vol. 32(1), pages 154-169, January.
    3. Xie, Xiaolan, 1998. "Stability analysis and optimization of an inventory system with bounded orders," European Journal of Operational Research, Elsevier, vol. 110(1), pages 126-149, October.
    4. Tunc, Huseyin & Kilic, Onur A. & Tarim, S. Armagan & Eksioglu, Burak, 2011. "The cost of using stationary inventory policies when demand is non-stationary," Omega, Elsevier, vol. 39(4), pages 410-415, August.
    5. Chiang, Chi, 2007. "Optimal ordering policies for periodic-review systems with a refined intra-cycle time scale," European Journal of Operational Research, Elsevier, vol. 177(2), pages 872-881, March.
    6. Huang, Boray & Wu, Andy, 2017. "Reduce shortage with self-reservation policy for a manufacturer paying both fixed and variable stockout expenditure," European Journal of Operational Research, Elsevier, vol. 262(3), pages 944-953.
    7. Awi Federgruen & Min Wang, 2015. "Inventory Models with Shelf-Age and Delay-Dependent Inventory Costs," Operations Research, INFORMS, vol. 63(3), pages 701-715, June.
    8. Bazsa-Oldenkamp, E.M. & den Iseger, P., 2002. "Optimal continuous order quantity (s,S) policies; the 45-degrees algorithm," Econometric Institute Research Papers EI 2002-47, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    9. Emöke Bázsa & Peter den Iseger, 2001. "Optimal Continuous Order Quantity (s,s) Policies," Tinbergen Institute Discussion Papers 01-102/4, Tinbergen Institute.
    10. Yu‐Sheng Zheng & Fangruo Chen, 1992. "Inventory policies with quantized ordering," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 285-305, April.
    11. Li, Xiaoming, 2010. "Optimal inventory policies in decentralized supply chains," International Journal of Production Economics, Elsevier, vol. 128(1), pages 303-309, November.
    12. Bazsa-Oldenkamp, E.M. & den Iseger, P., 2003. "Optimal continuous order quantity (s,S) policies - the 45-degrees algorithm," Econometric Institute Research Papers EI 2002-47, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    13. Sandun C. Perera & Suresh P. Sethi, 2023. "A survey of stochastic inventory models with fixed costs: Optimality of (s, S) and (s, S)‐type policies—Discrete‐time case," Production and Operations Management, Production and Operations Management Society, vol. 32(1), pages 131-153, January.
    14. Nasr, Walid W. & Maddah, Bacel, 2015. "Continuous (s, S) policy with MMPP correlated demand," European Journal of Operational Research, Elsevier, vol. 246(3), pages 874-885.
    15. Tarim, S. Armagan & Smith, Barbara M., 2008. "Constraint programming for computing non-stationary (R, S) inventory policies," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1004-1021, September.
    16. Awi Federgruen & Min Wang, 2013. "Monotonicity properties of a class of stochastic inventory systems," Annals of Operations Research, Springer, vol. 208(1), pages 155-186, September.
    17. Tamer Boyacı & Guillermo Gallego, 2002. "Managing waiting times of backordered demands in single‐stage (Q, r) inventory systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(6), pages 557-573, September.
    18. Srinivas Bollapragada & Thomas E. Morton, 1999. "A Simple Heuristic for Computing Nonstationary (s, S) Policies," Operations Research, INFORMS, vol. 47(4), pages 576-584, August.
    19. Luo, Sha & Ahiska, S. Sebnem & Fang, Shu-Cherng & King, Russell E. & Warsing, Donald P. & Wu, Shuohao, 2021. "An analysis of optimal ordering policies for a two-supplier system with disruption risk," Omega, Elsevier, vol. 105(C).
    20. B S Maddah & M Y Jaber & N E Abboud, 2004. "Periodic review (s, S) inventory model with permissible delay in payments," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 147-159, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orinte:v:46:y:2016:i:1:p:18-32. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.