IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v53y2005i4p698-710.html
   My bibliography  Save this article

Staggering Periodic Replenishment in Multivendor JIT Environments

Author

Listed:
  • Sin-Hoon Hum

    (Department of Decision Sciences, NUS Business School, National University of Singapore, Singapore 117591)

  • Moosa Sharafali

    (Department of Management, Faculty of Economics and Commerce, University of Melbourne, Melbourne, Victoria 3010, Australia)

  • Chung-Piaw Teo

    (SKK Graduate School of Business, Sungkyunkwan University, Seoul, South Korea 110745, teocp@skku.edu, and Department of Decision Sciences, NUS Business School, National University of Singapore, Singapore 117591)

Abstract

The delivery scheduling problem studied in this paper was motivated by the operation in a large personal computer assembly plant, which was using multisourcing for some of its materials. The company’s objective was to design a delivery schedule so that the average inventory level in the factory was minimized. We show that the problem is intimately related to a classical inventory staggering problem, where the focus is on the computation of the peak inventory level associated with the replenishment policy. This connection allows us to show that the delivery scheduling problem is NP-hard. For the two-vendor case with integral replenishment intervals, we propose a generalized form of Homer’s scheduling heuristic and obtain performance bounds for the classical inventory staggering problem. Our analysis uses the Chinese remainder theorem in an interesting way. The approach can be generalized to the case with more than two vendors, leading to a strong linear-programming-based lower bound for the inventory staggering problem. We illustrate this technique for the case in which all the replenishment intervals are relatively prime, establishing a bound that is not greater than 140% of the optimal. We examine the implications of these results to the delivery scheduling problem.

Suggested Citation

  • Sin-Hoon Hum & Moosa Sharafali & Chung-Piaw Teo, 2005. "Staggering Periodic Replenishment in Multivendor JIT Environments," Operations Research, INFORMS, vol. 53(4), pages 698-710, August.
    • Handle: RePEc:inm:oropre:v:53:y:2005:i:4:p:698-710
    DOI: 10.1287/opre.1040.0196
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1040.0196
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1040.0196?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. Randolph W. Hall, 1991. "Comments on "One-Warehouse Multiple Retailer Systems with Vehicle Routing Costs"," Management Science, INFORMS, vol. 37(11), pages 1496-1497, November.
    2. Robin Roundy, 1989. "Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems," Management Science, INFORMS, vol. 35(12), pages 1433-1442, December.
    3. Shoshana Anily, 1991. "Multi-Item Replenishment and Storage Problem (MIRSP): Heuristics and Bounds," Operations Research, INFORMS, vol. 39(2), pages 233-243, April.
    4. Klaus Zoller, 1977. "Deterministic Multi-Item Inventory Systems with Limited Capacity," Management Science, INFORMS, vol. 24(4), pages 451-455, December.
    5. Willis R. Greer, Jr. & Shu S. Liao, 1986. "An Analysis of Risk and Return in the Defense Market: Its Impact on Weapon System Competition," Management Science, INFORMS, vol. 32(10), pages 1259-1273, October.
    6. Guillermo Gallego & Maurice Queyranne & David Simchi-Levi, 1996. "Single Resource Multi-Item Inventory Systems," Operations Research, INFORMS, vol. 44(4), pages 580-595, August.
    Full references (including those not matched with items on IDEAS)

    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. Boctor, Fayez F., 2010. "Offsetting inventory replenishment cycles to minimize storage space," European Journal of Operational Research, Elsevier, vol. 203(2), pages 321-325, June.
    2. Dorit S. Hochbaum & Xu Rao, 2019. "The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem," Operations Research, INFORMS, vol. 67(5), pages 1345-1361, September.
    3. Fayez F. Boctor & Marie-Claude Bolduc, 2018. "The inventory replenishment planning and staggering problem: a bi-objective approach," 4OR, Springer, vol. 16(2), pages 199-224, June.
    4. Haksever, Cengiz & Moussourakis, John, 2005. "A model for optimizing multi-product inventory systems with multiple constraints," International Journal of Production Economics, Elsevier, vol. 97(1), pages 18-30, July.
    5. Beemsterboer, Bart & Teunter, Ruud & Riezebos, Jan, 2016. "Two-product storage-capacitated inventory systems: A technical note," International Journal of Production Economics, Elsevier, vol. 176(C), pages 92-97.
    6. D. Beyer & S. P. Sethi & R. Sridhar, 2001. "Stochastic Multiproduct Inventory Models with Limited Storage," Journal of Optimization Theory and Applications, Springer, vol. 111(3), pages 553-588, December.
    7. Favaretto, Daniela & Pesenti, Raffaele & Ukovich, Walter, 2001. "Discrete frequency models for inventory management - an introduction," International Journal of Production Economics, Elsevier, vol. 71(1-3), pages 331-342, May.
    8. Kaijie Zhu & Ulrich W. Thonemann, 2009. "Coordination of pricing and inventory control across products," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(2), pages 175-190, March.
    9. Ramesh Bollapragada & Uday Rao, 1999. "Single-Stage Resource Allocation and Economic Lot Scheduling on Multiple, Nonidentical Production Lines," Management Science, INFORMS, vol. 45(6), pages 889-904, June.
    10. Murthy, Nagesh N. & Benton, W. C. & Rubin, Paul A., 2003. "Offsetting inventory cycles of items sharing storage," European Journal of Operational Research, Elsevier, vol. 150(2), pages 304-319, October.
    11. William P. Rogerson, 1988. "Profit Regulation of Defense Contractors and Prizes for Innovation : Theory and Evidence," Discussion Papers 759, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    12. Vettas, Nikolaos & Biglaiser, Gary, 2004. "Dynamic Price Competition with Capacity Constraints and Strategic Buyers," CEPR Discussion Papers 4315, C.E.P.R. Discussion Papers.
    13. Adeinat, Hamza & Pazhani, Subramanian & Mendoza, Abraham & Ventura, Jose A., 2022. "Coordination of pricing and inventory replenishment decisions in a supply chain with multiple geographically dispersed retailers," International Journal of Production Economics, Elsevier, vol. 248(C).
    14. Tunay I. Tunca & Qiong Wu, 2009. "Multiple Sourcing and Procurement Process Selection with Bidding Events," Management Science, INFORMS, vol. 55(5), pages 763-780, May.
    15. Rappold, James A. & Yoho, Keenan D., 2014. "Setting safety stocks for stable rotation cycle schedules," International Journal of Production Economics, Elsevier, vol. 156(C), pages 146-158.
    16. Luca Bertazzi & Maria Grazia Speranza & Walter Ukovich, 2000. "Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies," Management Science, INFORMS, vol. 46(7), pages 973-988, July.
    17. Pesenti, Raffaele & Ukovich, Walter, 2003. "Economic lot scheduling on multiple production lines with resource constraints," International Journal of Production Economics, Elsevier, vol. 81(1), pages 469-481, January.
    18. K. T. Wallenius & N. K. Womer, 1989. "Cost realism in defense contracting," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(5), pages 533-557, October.
    19. Mark Goh & Ou Jihong & Teo Chung‐Piaw, 2001. "Warehouse sizing to minimize inventory and storage costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(4), pages 299-312, June.
    20. Chung-Piaw Teo & Dimitris Bertsimas, 2001. "Multistage Lot Sizing Problems via Randomized Rounding," Operations Research, INFORMS, vol. 49(4), pages 599-608, August.

    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:oropre:v:53:y:2005:i:4:p:698-710. 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.