Note—A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions
From MaRDI portal
Publication:3750465
Recommendations
- An efficient algorithm for a generalized joint replenishment problem
- Joint replenishment problem under continuous unit cost change
- Joint Replenishment in Multi-Item Inventory Systems
- Comment on “A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions”
- A New Optimal Algorithm for the Joint Replenishment Problem
Cited in
(14)- The performance ratio of grouping policies for the joint replenishment problem
- Computing near-optimal policies in generalized joint replenishment
- The Joint Replenishment Problem with General Joint Cost Structures
- scientific article; zbMATH DE number 2040788 (Why is no real title available?)
- Improved randomized approximation algorithms for lot-sizing problems
- Joint replenishment problem under continuous unit cost change
- The effectiveness of heuristic algorithms for multi-item inventory systems with joint replenishment costs
- Calculating can-order policies for the joint replenishment problem by the compensation approach
- Models and algorithms for the dynamic-demand joint replenishment problem
- An approximate dynamic-programming approach to the joint replenishment problem
- Comment on “A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions”
- A genetic algorithm for joint replenishment based on the exact inventory cost
- Fixed cycle, basic cycle and EOQ approaches to the multi-item single-supplier inventory system
- Joint Replenishment in Multi-Item Inventory Systems
This page was built for publication: Note—A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750465)
