The replenishment problem with multiple articles and an order threshold

DOI10.1016/J.COR.2021.105485MaRDI QIDQ2669586zbMATH OpenOpenAlexFDO

Authors Dirk Briskorn, Thomas Wensing

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

zbMATH Keywords

dynamic programmingmixed-integer programming modelsorder thresholdreplenishment problemrolling horizon approach

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Single Item Multi-period Multi-retailer Inventory Replenishment Problem with Restricted Order Size
• Optimal replenishment order placement in a finite time horizon
• An Optimal Heuristic for Coordinated Multi-Item Inventory Replenishments
• Efficient algorithms for the joint replenishment problem with minimum order quantities
• Determining the optimum ordering policy in multi-item joint replenishment problem using a novel method
• Multiple replenishment orders in a continuous-review inventory system with lost sales
• Approximation algorithms for replenishment problems with fixed turnover times
• Approximation algorithms for replenishment problems with fixed turnover times
• The multi-item newsvendor problem with a budget constraint and fixed ordering costs

Cites work

• A classification of literature on determining the lot size under quantity discounts
• A cost-efficient method to optimize package size in emerging markets
• A Dual Ascent Procedure for Multiproduct Dynamic Demand Coordinated Replenishment with Backlogging
• A dynamic programming algorithm for the knapsack problem with setup
• A family of dynamic inventory models
• A review of the joint replenishment problem literature: 1989--2005
• An Algorithm for Large Zero-One Knapsack Problems
• An efficient optimal solution method for the joint replenishment problem with minimum order quantities
• An exact approach for the 0-1 knapsack problem with setups
• An Inventory Model Embedded in Designing a Supply Contract
• Core problems in knapsack algorithms
• Dynamic version of the economic lot size model
• Exact Algorithms For The Setup Knapsack Problem
• Exact approaches for the knapsack problem with setups
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Joint replenishment inventory control: Deterministic and stochastic models
• Knapsack problems with setups
• Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
• Optimal inventory management using retail prepacks
• Ship-pack optimization in a two-echelon distribution system
• The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions

Cited in

(2)

• A replenishment decision involving partial postponement
• Optimal replenishment order placement in a finite time horizon

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: The replenishment problem with multiple articles and an order threshold

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669586)