IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v254y2016i1p105-112.html
   My bibliography  Save this article

Offsetting inventory replenishment cyclesAuthor-Name: Russell, Robert A

Author

Listed:
  • Urban, Timothy L.

Abstract

The inventory-staggering problem is a multi-item inventory problem in which replenishment cycles are scheduled or offset in order to minimize the maximum inventory level over a given planning horizon. We incorporate symmetry-breaking constraints in a mixed-integer programming model to determine optimal and near-optimal solutions. Local-search heuristics and evolutionary polishing heuristics are also presented to achieve effective and efficient solutions. We examine extensions of the problem that include a continuous-time framework as well as the effect of stochastic demand.

Suggested Citation

  • Urban, Timothy L., 2016. "Offsetting inventory replenishment cyclesAuthor-Name: Russell, Robert A," European Journal of Operational Research, Elsevier, vol. 254(1), pages 105-112.
  • Handle: RePEc:eee:ejores:v:254:y:2016:i:1:p:105-112
    DOI: 10.1016/j.ejor.2016.03.055
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716302016
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2016.03.055?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Chu-Lun Hsieh & Wen-Hsien Tsai & Yao-Chung Chang, 2020. "Green Activity-Based Costing Production Decision Model for Recycled Paper," Energies, MDPI, vol. 13(10), pages 1-23, May.
    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.

    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:eee:ejores:v:254:y:2016:i:1:p:105-112. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.