The replenishment problem with multiple articles and an order threshold
From MaRDI portal
Publication:2669586
DOI10.1016/j.cor.2021.105485OpenAlexW3184437380MaRDI QIDQ2669586
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105485
dynamic programmingmixed-integer programming modelsreplenishment problemrolling horizon approachorder threshold
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A dynamic programming algorithm for the knapsack problem with setup
- Knapsack problems with setups
- Joint replenishment inventory control: Deterministic and stochastic models
- A classification of literature on determining the lot size under quantity discounts
- Optimal inventory management using retail prepacks
- An exact approach for the 0-1 knapsack problem with setups
- Exact approaches for the knapsack problem with setups
- Ship-pack optimization in a two-echelon distribution system
- A review of the joint replenishment problem literature: 1989--2005
- An efficient optimal solution method for the joint replenishment problem with minimum order quantities
- A cost-efficient method to optimize package size in emerging markets
- Dynamic Version of the Economic Lot Size Model
- Core Problems in Knapsack Algorithms
- A Family of Dynamic Inventory Models
- An Algorithm for Large Zero-One Knapsack Problems
- Exact Algorithms For The Setup Knapsack Problem
- A Dual Ascent Procedure for Multiproduct Dynamic Demand Coordinated Replenishment with Backlogging
- An Inventory Model Embedded in Designing a Supply Contract
- The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
This page was built for publication: The replenishment problem with multiple articles and an order threshold
