More on ‘Models and algorithms for the dynamic-demand joint replenishment problem’

DOI10.1080/00207540500270562zbMath1095.90006OpenAlexW1964017936MaRDI QIDQ5478823

No author found.

Publication date: 13 July 2006

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540500270562

zbMATH Keywords

heuristicjoint replenishmentdynamic demandtight formulation

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (1)

The dynamic-demand joint replenishment problem with approximated transportation costs

Cites Work

• Unnamed Item
• Dynamic Version of the Economic Lot Size Model
• Multiproduct dynamic lot-sizing model with coordinated replenishments
• Coordinated replenishments of items under time-varying demand: Dynamic programming formulation
• A Dual Ascent Procedure for Multiproduct Dynamic Demand Coordinated Replenishment with Backlogging
• Models and algorithms for the dynamic-demand joint replenishment problem
• A primal-dual algorithm for the dynamic lotsizing problem with joint set-up costs

This page was built for publication: More on ‘Models and algorithms for the dynamic-demand joint replenishment problem’