Pages that link to "Item:Q2503229"
From MaRDI portal
The following pages link to An efficient optimal solution method for the joint replenishment problem with minimum order quantities (Q2503229):
Displaying 16 items.
- An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities (Q418062) (← links)
- Determining the optimum ordering policy in multi-item joint replenishment problem using a novel method (Q473692) (← links)
- A genetic algorithm for joint replenishment based on the exact inventory cost (Q947954) (← links)
- A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows (Q1785294) (← links)
- A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs (Q1926904) (← links)
- Forecast horizon of dynamic lot size model for perishable inventory with minimum order quantities (Q2190277) (← links)
- A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities (Q2244219) (← links)
- An optimal solution technique for the joint replenishment problem with storage and transport capacities and budget constraints (Q2433463) (← links)
- A review of the joint replenishment problem literature: 1989--2005 (Q2462102) (← links)
- Synchronization in the single-manufacturer multi-buyer integrated inventory supply chain (Q2475822) (← links)
- The replenishment problem with multiple articles and an order threshold (Q2669586) (← links)
- Efficient algorithms for the joint replenishment problem with minimum order quantities (Q2670570) (← links)
- Optimization of a stochastic joint replenishment inventory system with service level constraints (Q2676403) (← links)
- The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard (Q5219699) (← links)
- Efficient methods for stochastic joint replenishment and delivery problem (Q6071057) (← links)
- Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation (Q6109334) (← links)