IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v13y2011i4p508-524.html
   My bibliography  Save this article

Value of Local Cash Reuse: Inventory Models for Medium-Size Depository Institutions Under the New Federal Reserve Policy

Author

Listed:
  • Yunxia Zhu

    (School of Management, University of Texas at Dallas, Richardson, Texas 75083)

  • Milind Dawande

    (School of Management, University of Texas at Dallas, Richardson, Texas 75083)

  • Chelliah Sriskandarajah

    (School of Management, University of Texas at Dallas, Richardson, Texas 75083)

Abstract

The effective local reuse of physical cash by depository institutions (DIs) is the primary goal of the new cash recirculation policy of the Federal Reserve System (Fed) of the United States. These guidelines, implemented since July 2007, encourage the reuse of cash by (i) penalizing a DI for the practice of cross shipping , the near-simultaneous deposit of used cash to--and withdrawal of fit cash from--the Fed; and (ii) offering a custodial inventory program that enables a DI to transfer fit cash to the Fed's books, but physically hold it within the DI's secured facility. The effective management of the inventory of cash under these new guidelines is both a challenging and important issue for DIs. We introduce two new multiperiod models--designed specifically to capture the operations of a medium-size DI--that emerge from the DI's objective to minimize the total cost incurred in managing the inventory of cash over a finite planning horizon. The Basic Model (BM) captures the DI's mode of operations if it chooses not to locally reuse cash and, instead, incur the cross-shipping penalty. Using two important structural properties, we provide a polynomial-time dynamic programming algorithm for BM. The Reuse Model (RM) represents the DI's actions when it locally recirculates cash. We first prove the hardness of RM and then develop an integer programming formulation. A comprehensive test bed--based on our interaction with a leading secure-logistics provider--helps us to develop several useful insights into the relative impacts of the DI-specific parameters and the Fed's cross-shipping fee on the effective management of cash. In particular, we show that the Value of Local Reuse for a DI, measured as the percentage cost saving between the optimal solutions of BM and RM, is substantial, and we analyze the forces that influence the volume of cross shipping. We also develop a rolling-horizon procedure to adapt the optimal solutions of BM and RM for obtaining near-optimal real-time solutions in the presence of a modest amount of uncertainty. Finally, we provide a comparative analysis of a DI's decisions under the Fed's mechanism and those under a socially optimal mechanism.

Suggested Citation

  • Yunxia Zhu & Milind Dawande & Chelliah Sriskandarajah, 2011. "Value of Local Cash Reuse: Inventory Models for Medium-Size Depository Institutions Under the New Federal Reserve Policy," Manufacturing & Service Operations Management, INFORMS, vol. 13(4), pages 508-524, October.
  • Handle: RePEc:inm:ormsom:v:13:y:2011:i:4:p:508-524
    DOI: 10.1287/msom.1110.0336
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.1110.0336
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.1110.0336?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. Robinson, Powell & Narayanan, Arunachalam & Sahin, Funda, 2009. "Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms," Omega, Elsevier, vol. 37(1), pages 3-15, February.
    2. Milind Dawande & Mili Mehrotra & Vijay Mookerjee & Chelliah Sriskandarajah, 2010. "An Analysis of Coordination Mechanisms for the U.S. Cash Supply Chain," Management Science, INFORMS, vol. 56(3), pages 553-570, March.
    3. Dieter Kalin, 1980. "On the Optimality of ((sigma), S ) Policies," Mathematics of Operations Research, INFORMS, vol. 5(2), pages 293-307, May.
    4. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    5. Mark Ferguson & V. Daniel R. Guide , Jr. & Gilvan C. Souza, 2006. "Supply Chain Coordination for False Failure Returns," Manufacturing & Service Operations Management, INFORMS, vol. 8(4), pages 376-393, August.
    6. Ellis L. Johnson, 1967. "Optimality and Computation of (\sigma, S) Policies in the Multi-Item Infinite Horizon Inventory Problem," Management Science, INFORMS, vol. 13(7), pages 475-491, March.
    7. Dev Joneja, 1990. "The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds," Operations Research, INFORMS, vol. 38(4), pages 711-723, August.
    8. Kuik, Roelof & Salomon, Marc & van Wassenhove, Luk N., 1994. "Batching decisions: structure and models," European Journal of Operational Research, Elsevier, vol. 75(2), pages 243-263, June.
    9. Guillermo Gallego & Özalp Özer, 2001. "Integrating Replenishment Decisions with Advance Demand Information," Management Science, INFORMS, vol. 47(10), pages 1344-1360, October.
    10. Marc Salomon & Leo G. Kroon & Roelof Kuik & Luk N. Van Wassenhove, 1991. "Some Extensions of the Discrete Lotsizing and Scheduling Problem," Management Science, INFORMS, vol. 37(7), pages 801-812, July.
    11. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    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. Yiwei Huang & Yunxia Zhu & Subodha Kumar & Bala Shetty & Chelliah Sriskandarajah, 2020. "A Framework for Analyzing the U.S. Coin Supply Chain," Production and Operations Management, Production and Operations Management Society, vol. 29(12), pages 2736-2759, December.

    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. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    2. Helber, Stefan & Sahling, Florian, 2010. "A fix-and-optimize approach for the multi-level capacitated lot sizing problem," International Journal of Production Economics, Elsevier, vol. 123(2), pages 247-256, February.
    3. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    4. Brahimi, Nadjib & Dauzere-Peres, Stephane & Najid, Najib M. & Nordli, Atle, 2006. "Single item lot sizing problems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 1-16, January.
    5. Rossi, Tommaso & Pozzi, Rossella & Testa, Mariapaola, 2017. "EOQ-based inventory management in single-machine multi-item systems," Omega, Elsevier, vol. 71(C), pages 106-113.
    6. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    7. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    8. 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.
    9. Bruno, Giuseppe & Genovese, Andrea & Piccolo, Carmela, 2014. "The capacitated Lot Sizing model: A powerful tool for logistics decision making," International Journal of Production Economics, Elsevier, vol. 155(C), pages 380-390.
    10. Wolter, Anja & Helber, Stefan, 2013. "Simultaneous Production and Maintenance Planning for a Single Capacitated Resource facing both a Dynamic Demand and Intensive Wear and Tear," Hannover Economic Papers (HEP) dp-522, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    11. Robinson, Powell & Narayanan, Arunachalam & Sahin, Funda, 2009. "Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms," Omega, Elsevier, vol. 37(1), pages 3-15, February.
    12. Toledo, Franklina Maria Bragion & Armentano, Vinicius Amaral, 2006. "A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1070-1083, December.
    13. Drexl, Andreas & Jordan, Carsten & Kimms, Alf, 1997. "Gruppierungs- und Reihenfolgeprobleme in der Fertigung," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 447, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    14. Narayanan, Arunachalam & Robinson, Powell, 2010. "Efficient and effective heuristics for the coordinated capacitated lot-size problem," European Journal of Operational Research, Elsevier, vol. 203(3), pages 583-592, June.
    15. Carsten Jordan & Andreas Drexl, 1998. "Discrete Lotsizing and Scheduling by Batch Sequencing," Management Science, INFORMS, vol. 44(5), pages 698-713, May.
    16. Vladimir Krasik & Joseph Leung & Michael Pinedo & Jiawei Zhang, 2008. "Scheduling multiple products on parallel machines with setup costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(7), pages 654-669, October.
    17. Minner, Stefan, 2009. "A comparison of simple heuristics for multi-product dynamic demand lot-sizing with limited warehouse capacity," International Journal of Production Economics, Elsevier, vol. 118(1), pages 305-310, March.
    18. Sahling, Florian & Buschkühl, Lisbeth & Tempelmeier, Horst & Helber, Stefan, 2008. "Solving a Multi-Level Capacitated Lot Sizing Problem with Multi-Period Setup Carry-Over via a Fix-and-Optimize Heuristic," Hannover Economic Papers (HEP) dp-400, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    19. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
    20. Meyr, H., 2000. "Simultaneous lotsizing and scheduling by combining local search with dual reoptimization," European Journal of Operational Research, Elsevier, vol. 120(2), pages 311-326, January.

    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:ormsom:v:13:y:2011:i:4:p:508-524. 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.