The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds
From MaRDI portal
Publication:3348674
DOI10.1287/opre.38.4.711zbMath0726.90021OpenAlexW2072798606MaRDI QIDQ3348674
Publication date: 1990
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.38.4.711
discrete timelot sizingjoint replenishmentNP- completeworst case performancenonstationary demandmultipass heuristic
Related Items
Preservation effort effects on retailers and manufacturers in integrated multi-deteriorating item discrete supply chain model ⋮ The submodular joint replenishment problem ⋮ The multi-item replenishment problem in a two-echelon supply chain: the effect of centralization versus decentralization ⋮ Approximation algorithms for inventory problems with submodular or routing costs ⋮ A MODIFIED JOINT INVENTORY POLICY FOR VMI SYSTEMS ⋮ Modeling industrial lot sizing problems: a review ⋮ A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand ⋮ Unnamed Item ⋮ Single‐warehouse multi‐retailer inventory systems with full truckload shipments ⋮ The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard ⋮ The coordinated replenishment dynamic lot-sizing problem with quantity discounts ⋮ Efficient and effective heuristics for the coordinated capacitated lot-size problem
This page was built for publication: The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds
