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

DOI10.1002/1520-6750(199312)40:7%3C925::AID-NAV3220400705%3E3.0.CO;2-CMaRDI QIDQ4287983zbMATH OpenOpenAlexFDO

Authors Kavindra Malik, Yufei Wang

Publication date 1 December 1994

Full work available at URL https://doi.org/10.1002/1520-6750(199312)40:7%3C925::aid-nav3220400705%3E3.0.co;2-c

zbMATH Keywords

dynamic lot-sizingworst-case complexitynonstationary production costs

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Recommendations

• A Dynamic Lot Sizing Model with Learning in Setups
• Improved algorithms for dynamic lot sizing problems with incremental discount
• An efficient algorithm for the dynamic economic lot size problem
• An algorithm based on a new sufficient condition of optimality in dynamic lot size model
• Lot sizing with learning and forgetting in setups: analytical results and insights
• Capacitated lot sizing under setup learning
• An efficient integer programming model of the dynamic lot-sizing problem
• A combined heuristic approach to dynamic lot sizing problems
• A new heuristic approach for the multi-item dynamic lot sizing problem
• A primal-dual algorithm for the dynamic lotsizing problem with joint set-up costs

Cited in

(5)

• Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
• Capacitated lot sizing under setup learning
• Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost
• 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

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