An improved algorithm for the dynamic lot-sizing problem with learning effect in setups

DOI<925::AID-NAV3220400705>3.0.CO;2-C 10.1002/1520-6750(199312)40:7<925::AID-NAV3220400705>3.0.CO;2-CzbMath0801.90036OpenAlexW2023093290MaRDI QIDQ4287983

Kavindra Malik, Yufei Wang

Publication date: 1 December 1994

Full work available at URL: https://doi.org/10.1002/1520-6750(199312)40:7<925::aid-nav3220400705>3.0.co;2-c

zbMATH Keywords

worst-case complexitydynamic lot-sizingnonstationary production costs

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (3)

Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions ⋮ Optimising lot sizing and order scheduling with non-linear production rates ⋮ Multiproduct production planning in the presence of work-force learning

This page was built for publication: An improved algorithm for the dynamic lot-sizing problem with learning effect in setups