Efficient algorithms for the joint replenishment problem with minimum order quantities
Authors:
- Ana MurielAMAna Muriel
- Tammana ChughTCTammana Chugh
- Michael ProkleMPMichael Prokle
- 1 July 2022
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 300 (1) , 137-150
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- An O(T3) algorithm for the capacitated lot sizing problem with minimum order quantitiesEuropean Journal of Operational Research, 2011
- A review of the joint replenishment problem literature: 1989–2005European Journal of Operational Research, 2008
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costsRAIRO - Operations Research, 2007
- An efficient optimal solution method for the joint replenishment problem with minimum order quantitiesEuropean Journal of Operational Research, 2006
- ON THE STRUCTURE OF OPTIMAL ORDERING POLICIES FOR STOCHASTIC INVENTORY SYSTEMS WITH MINIMUM ORDER QUANTITYProbability in the Engineering and Informational Sciences, 2006
- Inventory replenishment model: lot sizing versus just-in-time deliveryOperations Research Letters, 2004
- MIP-based heuristics for capacitated lotsizing problemsInternational Journal of Production Economics, 2003
- Inventory management with periodic ordering and minimum order quantitiesJournal of the Operational Research Society, 1998
- Joint replenishment inventory control: Deterministic and stochastic modelsEuropean Journal of Operational Research, 1989
- The Joint Replenishment Problem with a Powers-of-Two RestrictionIIE Transactions, 1985