An algorithm for general infinite horizon lot sizing with deterministic demand

DOI10.1186/S40736-017-0031-6MaRDI QIDQ1704039zbMATH OpenOpenAlexWikidataFDO

Authors Milan Horniaček

Publication date 8 March 2018

Published in Pacific Journal of Mathematics for Industry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1186/s40736-017-0031-6

zbMATH Keywords

critical perioddiscounting of future costforward inductioninventorylot sizingnon-cyclical deterministic demand

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Recommendations

• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• scientific article; zbMATH DE number 31719
• An efficient algorithm for the dynamic economic lot size problem
• scientific article; zbMATH DE number 232493
• Dynamic version of the economic lot size model

Cites work

• Constrained model predictive control: Stability and optimality
• Dynamic version of the economic lot size model
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• Principles of inventory management. When you are down to four, order more.
• Scenario-based model predictive control for multi-echelon supply chain management

Cited in

(3)

• A perfect lot-tree procedure for the discounted dynamic lot-size problem with speculation
• Suboptimality of equal lot sizes for finite-horizon problems
• The value function of an infinite-horizon single-item lot-sizing problem

This page was built for publication: An algorithm for general infinite horizon lot sizing with deterministic demand

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