The single item dynamic lot sizing problem with minimum lot size restriction

DOI10.1007/978-3-642-00142-0_15zbMATH Open1209.90142OpenAlexW42951796MaRDI QIDQ5391995FDOQ5391995

Authors: Irena Okhrin, Knut Richter 

Publication date: 7 April 2011

Published in: Operations Research Proceedings 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00142-0_15

Recommendations

• Lot sizing with minimum order quantity
• An effective algorithm for the capacitated single item lot size problem
• An efficient algorithm for the dynamic economic lot size problem
• An efficient algorithm for the capacitated single item dynamic lot size problem
• A new dynamic programming algorithm for the single item capacitated dynamic lot size model

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Production models (90B30)

Cited In (6)

• Single-item dynamic lot-sizing problems: an updated survey
• A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities
• A single-item lot-sizing problem with a by-product and inventory capacities
• An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities
• Lot sizing with minimum order quantity
• A dynamic model for inventory lot-sizing and outbound shipment scheduling with a minimum order amount constraint

This page was built for publication: The single item dynamic lot sizing problem with minimum lot size restriction

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