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

DOI10.1002/1520-6750(199508)42:5%3C791::AID-NAV3220420506%3E3.0.CO;2-8zbMATH Open0840.90055OpenAlexW1975597515MaRDI QIDQ4862299FDOQ4862299

ömer Kirca

Publication date: 4 July 1996

Full work available at URL: https://doi.org/10.1002/1520-6750(199508)42:5%3C791::aid-nav3220420506%3E3.0.co;2-8

Recommendations

• Multi-item lot-sizing with joint set-up costs
• Set partitioning and column generation heuristics for capacitated dynamic lotsizing
• A dual algorithm for the economic lot-sizing problem
• Primal-dual approach to the single level capacitated lot-sizing problem
• An effective algorithm for the capacitated single item lot size problem

zbMATH Keywords

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

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Cited In (10)

• Data-driven assignment of delivery patterns with handling effort considerations in retail
• An improved algorithm for the dynamic lot-sizing problem with learning effect in setups
• Efficient and effective heuristics for the coordinated capacitated lot-size problem
• A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand
• A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment
• The one-warehouse multi-retailer problem: reformulation, classification, and computational results
• Multi-item single source ordering problem with transportation cost: A Lagrangian decomposition approach
• Models and algorithms for the dynamic-demand joint replenishment problem
• Multi-item lot-sizing with joint set-up costs
• More on ‘Models and algorithms for the dynamic-demand joint replenishment problem’

This page was built for publication: A primal-dual algorithm for the dynamic lotsizing problem with joint set-up costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4862299)