A primal-dual algorithm for the dynamic lotsizing problem with joint set-up costs

DOI<791::AID-NAV3220420506>3.0.CO;2-8 10.1002/1520-6750(199508)42:5<791::AID-NAV3220420506>3.0.CO;2-8zbMath0840.90055OpenAlexW1975597515MaRDI QIDQ4862299

ömer Kirca

Publication date: 4 July 1996

Full work available at URL: https://doi.org/10.1002/1520-6750(199508)42:5<791::aid-nav3220420506>3.0.co;2-8

zbMATH Keywords

branch-and-boundjoint set-up costsstrong lower boundmulti-item dynamic lotsizing

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items

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 ⋮ The one-warehouse multi-retailer problem: reformulation, classification, and computational results ⋮ Models and algorithms for the dynamic-demand joint replenishment problem ⋮ Data-driven assignment of delivery patterns with handling effort considerations in retail ⋮ More on ‘Models and algorithms for the dynamic-demand joint replenishment problem’ ⋮ Efficient and effective heuristics for the coordinated capacitated lot-size problem