An efficient optimal solution method for the joint replenishment problem with minimum order quantities
From MaRDI portal
Publication:2503229
DOI10.1016/j.ejor.2005.02.056zbMath1103.90309MaRDI QIDQ2503229
Publication date: 14 September 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://repub.eur.nl/pub/1084
90B05: Inventory, storage, reservoirs
Related Items
The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard, The joint replenishment problem involving multiple suppliers offering quantity discounts, An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities, Determining the optimum ordering policy in multi-item joint replenishment problem using a novel method, A genetic algorithm for joint replenishment based on the exact inventory cost, A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows, A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs, Forecast horizon of dynamic lot size model for perishable inventory with minimum order quantities, A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities, An optimal solution technique for the joint replenishment problem with storage and transport capacities and budget constraints, A review of the joint replenishment problem literature: 1989--2005, Synchronization in the single-manufacturer multi-buyer integrated inventory supply chain, The replenishment problem with multiple articles and an order threshold, Efficient algorithms for the joint replenishment problem with minimum order quantities, Optimization of a stochastic joint replenishment inventory system with service level constraints
Cites Work
