IDEAS home Printed from https://ideas.repec.org/a/spr/aqjoor/v16y2018i2d10.1007_s10288-017-0362-2.html
   My bibliography  Save this article

The inventory replenishment planning and staggering problem: a bi-objective approach

Author

Listed:
  • Fayez F. Boctor

    (Université Laval)

  • Marie-Claude Bolduc

    (Université Laval)

Abstract

To the best of our knowledge, this paper is the first one to suggest formulating the inventory replenishment problem as a bi-objective decision problem where, in addition to minimizing the sum of order and inventory holding costs, we should minimize the required storage space. Also, it develops two solution methods, called the exploratory method (EM) and the two-population evolutionary algorithm (TPEA), to solve the problem. The proposed methods generate a near-Pareto front of solutions with respect to the considered objectives. As the inventory replenishment problem have never been formulated as a bi-objective problem and as the literature does not provide any method to solve the considered bi-objective problem, we compared the results of the EM to three versions of the TPEA. The results obtained suggest that although the TPEA produces good near-Pareto solutions, the decision maker can apply a combination of both methods and choose among all the obtained solutions.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:aqjoor:v:16:y:2018:i:2:d:10.1007_s10288-017-0362-2
    DOI: 10.1007/s10288-017-0362-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10288-017-0362-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10288-017-0362-2?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.

    References listed on IDEAS

    as
    1. Konak, Abdullah & Coit, David W. & Smith, Alice E., 2006. "Multi-objective optimization using genetic algorithms: A tutorial," Reliability Engineering and System Safety, Elsevier, vol. 91(9), pages 992-1007.
    2. 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.
    3. Ouenniche, Jamal & Boctor, Fayez F., 2001. "The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops," European Journal of Operational Research, Elsevier, vol. 129(3), pages 539-554, March.
    4. 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.
    5. Meir J. Rosenblatt & Uriel G. Rothblum, 1990. "On the Single Resource Capacity Problem for Multi-Item Inventory Systems," Operations Research, INFORMS, vol. 38(4), pages 686-693, August.
    6. Khouja, Moutaz & Goyal, Suresh, 2008. "A review of the joint replenishment problem literature: 1989-2005," European Journal of Operational Research, Elsevier, vol. 186(1), pages 1-16, April.
    7. Yao, Ming-Jong & Chu, Weng-Ming, 2008. "A genetic algorithm for determining optimal replenishment cycles to minimize maximum warehouse space requirements," Omega, Elsevier, vol. 36(4), pages 619-631, August.
    8. 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.
    9. Shoshana Anily, 1991. "Multi-Item Replenishment and Storage Problem (MIRSP): Heuristics and Bounds," Operations Research, INFORMS, vol. 39(2), pages 233-243, April.
    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. Klaus Zoller, 1977. "Deterministic Multi-Item Inventory Systems with Limited Capacity," Management Science, INFORMS, vol. 24(4), pages 451-455, December.
    12. Mohammad K. El-Najdawi & Paul R. Kleindorfer, 1993. "Common Cycle Lot-Size Scheduling for Multi-Product, Multi-Stage Production," Management Science, INFORMS, vol. 39(7), pages 872-885, July.
    13. Guillermo Gallego & Maurice Queyranne & David Simchi-Levi, 1996. "Single Resource Multi-Item Inventory Systems," Operations Research, INFORMS, vol. 44(4), pages 580-595, August.
    14. Karimi, B. & Fatemi Ghomi, S. M. T. & Wilson, J. M., 2003. "The capacitated lot sizing problem: a review of models and algorithms," Omega, Elsevier, vol. 31(5), pages 365-378, October.
    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. 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.
    2. 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.
    3. 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.
    4. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    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. 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.
    8. Nguyen, Christine & Dessouky, Maged & Toriello, Alejandro, 2014. "Consolidation strategies for the delivery of perishable products," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 108-121.
    9. 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.
    10. Rezaei, Jafar & Davoodi, Mansoor, 2011. "Multi-objective models for lot-sizing with supplier selection," International Journal of Production Economics, Elsevier, vol. 130(1), pages 77-86, March.
    11. 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.
    12. Saravanan Venkatachalam & Arunachalam Narayanan, 2016. "Efficient formulation and heuristics for multi-item single source ordering problem with transportation cost," International Journal of Production Research, Taylor & Francis Journals, vol. 54(14), pages 4087-4103, July.
    13. Zhang, Guoqing & Shang, Xiaoting & Alawneh, Fawzat & Yang, Yiqin & Nishi, Tatsushi, 2021. "Integrated production planning and warehouse storage assignment problem: An IoT assisted case," International Journal of Production Economics, Elsevier, vol. 234(C).
    14. Koca, Esra & Yaman, Hande & Selim Aktürk, M., 2015. "Stochastic lot sizing problem with controllable processing times," Omega, Elsevier, vol. 53(C), pages 1-10.
    15. Hwang, Hark-Chin & Kang, Jangha, 2016. "Two-phase algorithm for the lot-sizing problem with backlogging for stepwise transportation cost without speculative motives," Omega, Elsevier, vol. 59(PB), pages 238-250.
    16. Zhang, Wei & Rajaram, Kumar, 2017. "Managing limited retail space for basic products: Space sharing vs. space dedication," European Journal of Operational Research, Elsevier, vol. 263(3), pages 768-781.
    17. Lee, Jinkyu & Bae, Sanghyeon & Kim, Woo Chang & Lee, Yongjae, 2023. "Value function gradient learning for large-scale multistage stochastic programming problems," European Journal of Operational Research, Elsevier, vol. 308(1), pages 321-335.
    18. 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.
    19. Timo Hilger & Florian Sahling & Horst Tempelmeier, 2016. "Capacitated dynamic production and remanufacturing planning under demand and return uncertainty," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 849-876, October.
    20. 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.

    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:spr:aqjoor:v:16:y:2018:i:2:d:10.1007_s10288-017-0362-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.