Lot-trees: A unifying view and efficient implementation of forward procedures for the dynamic lot-size problem

DOI10.1016/0305-0548(90)90002-OMaRDI QIDQ910333zbMATH OpenOpenAlexFDO

Authors Michael Bastian

Publication date 1990

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(90)90002-o

zbMATH Keywords

dynamic lot-size problemforward solution procedureslot treesplanning horizon results

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
• A perfect lot-tree procedure for the discounted dynamic lot-size problem with speculation
• An efficient algorithm for the dynamic economic lot size problem
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• Dynamic version of the economic lot size model

Cites work

• Dynamic version of the economic lot size model
• Efficient heuristics for dynamic lot sizing
• Minimal forecast horizon procedures for dynamic lot size models
• Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results
• Two Modifications Of The Silver-Meal Lot Sizing Heuristic

Cited in

(5)

• Efficient post-optimization analysis procedure for the dynamic lot-sizing problem
• A perfect lot-tree procedure for the discounted dynamic lot-size problem with speculation
• Sequential stability of the constant cost dynamic lot size model- searching for monotonicity
• A perfect forward procedure for a single facility dynamic location/relocation problem
• Remanufacturing planning for the reverse Wagner/Whitin models

This page was built for publication: Lot-trees: A unifying view and efficient implementation of forward procedures for the dynamic lot-size problem

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