IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v43y2018i4p1269-1289.html
   My bibliography  Save this article

The Periodic Joint Replenishment Problem Is Strongly š¯’©š¯’«-Hard

Author

Listed:
  • Tamar Cohen-Hillel

    (Operations Research Center, Massachusetts Institute of Technologyā€“Hillel, Cambridge, Massachusetts 02139)

  • Liron Yedidsion

    (Faculty of Industrial Engineering and Management, Technionā€“Israel Institute of Technology, Haifa 3200003, Israel)

Abstract

In this paper, we study the long-standing open question regarding the computational complexity of one of the core problems in supply chains management, the periodic joint replenishment problem. This problem has received a lot of attention over the years, and many heuristic and approximation algorithms have been suggested. However, in spite of the vast effort, the complexity of the problem remains unresolved. In this paper, we provide a proof that the problem is indeed strongly š¯’©š¯’«-hard.

Suggested Citation

  • Tamar Cohen-Hillel & Liron Yedidsion, 2018. "The Periodic Joint Replenishment Problem Is Strongly š¯’©š¯’«-Hard," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1269-1289, November.
    • Handle: RePEc:inm:ormoor:v:43:y:2018:i:4:p:1269-1289
    DOI: 10.1287/moor.2017.0904
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/moor.2017.0904
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2017.0904?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. Dev Joneja, 1990. "The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds," Operations Research, INFORMS, vol. 38(4), pages 711-723, August.
    2. Porras, Eric & Dekker, Rommert, 2006. "An efficient optimal solution method for the joint replenishment problem with minimum order quantities," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1595-1615, November.
    3. Lu Lu & Marc E. Posner, 1994. "Approximation Procedures for the One-Warehouse Multi-Retailer System," Management Science, INFORMS, vol. 40(10), pages 1305-1316, October.
    4. S Viswanathan, 2002. "On optimal algorithms for the joint replenishment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(11), pages 1286-1290, November.
    5. Moon, I.K. & Cha, B.C., 2006. "The joint replenishment problem with resource restriction," European Journal of Operational Research, Elsevier, vol. 173(1), pages 190-198, August.
    6. Wildeman, R.E. & Frenk, J.B.G. & Dekker, R., 1997. "An efficient optimal solution method for the joint replenishment problem," European Journal of Operational Research, Elsevier, vol. 99(2), pages 433-444, June.
    7. S. K. Goyal, 1973. "Determination of Economic Packaging Frequency for Items Jointly Replenished," Management Science, INFORMS, vol. 20(2), pages 232-235, October.
    8. Retsef Levi & Robin Roundy & David Shmoys & Maxim Sviridenko, 2008. "A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem," Management Science, INFORMS, vol. 54(4), pages 763-776, April.
    9. 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.
    10. Dominique J. Nocturne, 1973. "Note--Economic Ordering Frequency for Several Items Jointly Replenished," Management Science, INFORMS, vol. 19(9), pages 1093-1096, May.
    11. Porras Musalem, E. & Dekker, R., 2005. "Generalized Solutions for the joint replenishment problem with correction factor," Econometric Institute Research Papers EI 2005-19, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    12. John A. Muckstadt & Robin O. Roundy, 1987. "Multi-Item, One-Warehouse, Multi-Retailer Distribution Systems," Management Science, INFORMS, vol. 33(12), pages 1613-1621, December.
    13. Robin Roundy, 1985. "98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems," Management Science, INFORMS, vol. 31(11), pages 1416-1430, November.
    14. Porras Musalem, E. & Dekker, R., 2004. "On the efficiency of optimal algorithms for the joint replenishment problem: a comparative study," Econometric Institute Research Papers EI 2004-33, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    15. Goyal, Suresh K. & Satir, Ahmet T., 1989. "Joint replenishment inventory control: Deterministic and stochastic models," European Journal of Operational Research, Elsevier, vol. 38(1), pages 2-13, January.
    16. Edward A. Silver, 1976. "A Simple Method of Determining Order Quantities in Joint Replenishments Under Deterministic Demand," Management Science, INFORMS, vol. 22(12), pages 1351-1361, August.
    17. R Y K Fung & X Ma, 2001. "A new method for joint replenishment problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(3), pages 358-362, March.
    18. Frank T. Shu, 1971. "Economic Ordering Frequency for two Items Jointly Replenished," Management Science, INFORMS, vol. 17(6), pages 406-410, February.
    19. Chung-Piaw Teo & Dimitris Bertsimas, 2001. "Multistage Lot Sizing Problems via Randomized Rounding," Operations Research, INFORMS, vol. 49(4), pages 599-608, August.
    20. Retsef Levi & Robin O. Roundy & David B. Shmoys, 2006. "Primal-Dual Algorithms for Deterministic Inventory Problems," Mathematics of Operations Research, INFORMS, vol. 31(2), pages 267-284, May.
    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. Park, Hyungjun & Choi, Dong Gu & Min, Daiki, 2023. "Adaptive inventory replenishment using structured reinforcement learning by exploiting a policy structure," International Journal of Production Economics, Elsevier, vol. 266(C).
    2. Xuefei Shi & Haiyan Wang, 2022. "Design of the cost allocation rule for joint replenishment to an overseas warehouse with a piecewise linear holding cost rate," Operational Research, Springer, vol. 22(5), pages 4905-4929, November.
    3. Yao, Ming-Jong & Lin, Jen-Yen & Lin, Yu-Liang & Fang, Shu-Cherng, 2020. "An integrated algorithm for solving multi-customer joint replenishment problem with districting consideration," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).

    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. 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.
    2. Jen-Yen Lin & Ming-Jong Yao, 2020. "The joint replenishment problem with trade credits," Journal of Global Optimization, Springer, vol. 76(2), pages 347-382, February.
    3. Hoque, M.A., 2006. "An optimal solution technique for the joint replenishment problem with storage and transport capacities and budget constraints," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1033-1042, December.
    4. Wang, Lin & He, Jing & Wu, Desheng & Zeng, Yu-Rong, 2012. "A novel differential evolution algorithm for joint replenishment problem under interdependence and its application," International Journal of Production Economics, Elsevier, vol. 135(1), pages 190-198.
    5. Yao, Ming-Jong & Lin, Jen-Yen & Lin, Yu-Liang & Fang, Shu-Cherng, 2020. "An integrated algorithm for solving multi-customer joint replenishment problem with districting consideration," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
    6. Xuefei Shi & Haiyan Wang, 2022. "Design of the cost allocation rule for joint replenishment to an overseas warehouse with a piecewise linear holding cost rate," Operational Research, Springer, vol. 22(5), pages 4905-4929, November.
    7. Nilsson, Andreas & Segerstedt, Anders & van der Sluis, Erik, 2007. "A new iterative heuristic to solve the joint replenishment problem using a spreadsheet technique," International Journal of Production Economics, Elsevier, vol. 108(1-2), pages 399-405, July.
    8. Bayindir, Z.P. & Birbil, S.I. & Frenk, J.B.G., 2006. "The joint replenishment problem with variable production costs," European Journal of Operational Research, Elsevier, vol. 175(1), pages 622-640, November.
    9. Shiyu Liu & Ou Liu & Xiaoming Jiang, 2023. "An Efficient Algorithm for the Joint Replenishment Problem with Quantity Discounts, Minimum Order Quantity and Transport Capacity Constraints," Mathematics, MDPI, vol. 11(4), pages 1-18, February.
    10. Ji Seong Noh & Jong Soo Kim & Biswajit Sarkar, 2019. "Stochastic joint replenishment problem with quantity discounts and minimum order constraints," Operational Research, Springer, vol. 19(1), pages 151-178, March.
    11. Amaya, Ciro Alberto & Carvajal, Jimmy & CastaƱo, Fabian, 2013. "A heuristic framework based on linear programming to solve the constrained joint replenishment problem (C-JRP)," International Journal of Production Economics, Elsevier, vol. 144(1), pages 243-247.
    12. Shiman Ding & Philip M. Kaminsky, 2020. "Centralized and Decentralized Warehouse Logistics Collaboration," Manufacturing & Service Operations Management, INFORMS, vol. 22(4), pages 812-831, July.
    13. Danny Segev, 2014. "An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 432-444, May.
    14. Francisco Silva & Lucia Gao, 2013. "A Joint Replenishment Inventory-Location Model," Networks and Spatial Economics, Springer, vol. 13(1), pages 107-122, March.
    15. Olsen, Anne L., 2008. "Inventory replenishment with interdependent ordering costs: An evolutionary algorithm solution," International Journal of Production Economics, Elsevier, vol. 113(1), pages 359-369, May.
    16. Gautier Stauffer, 2018. "Approximation algorithms for k-echelon extensions of the one warehouse multi-retailer problem," Mathematical Methods of Operations Research, Springer;Gesellschaft fĆ¼r Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 88(3), pages 445-473, December.
    17. Jean-Philippe Gayon & Guillaume Massonnet & Christophe Rapine & Gautier Stauffer, 2017. "Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 854-875, August.
    18. Ongkunaruk, P. & Wahab, M.I.M. & Chen, Y., 2016. "A genetic algorithm for a joint replenishment problem with resource and shipment constraints and defective items," International Journal of Production Economics, Elsevier, vol. 175(C), pages 142-152.
    19. A Nilsson & E A Silver, 2008. "A simple improvement on Silver's heuristic for the joint replenishment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(10), pages 1415-1421, October.
    20. Ata Allah Taleizadeh & Hadi Samimi & Babak Mohammadi, 2015. "Joint replenishment policy with backordering and special sale," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(7), pages 1172-1198, May.

    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:ormoor:v:43:y:2018:i:4:p:1269-1289. 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.