The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions

DOI10.1287/opre.42.6.1067zbMath0824.90055MaRDI QIDQ4834062

Michal Tzur, Awi Federgruen

Publication date: 9 November 1995

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.42.6.1067

zbMATH Keywords

branch-and-bound; joint replenishment problem; dynamic lot sizing; joint setup costs; asymptotically optimal heuristics; partitioning heuristic

Mathematics Subject Classification ID

90B05: Inventory, storage, reservoirs

Related Items

Models and algorithms for the dynamic-demand joint replenishment problem, Joint replenishment problem under continuous unit cost change, Modeling industrial lot sizing problems: a review, Dynamic lot sizing for multiple products with a new joint replenishment model, Multi-item single source ordering problem with transportation cost: A Lagrangian decomposition approach, A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand, Efficient and effective heuristics for the coordinated capacitated lot-size problem, Scheduling multimodal transportation systems., The multi-item replenishment problem in a two-echelon supply chain: the effect of centralization versus decentralization, A review of the joint replenishment problem literature: 1989--2005, Unnamed Item