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

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

0.00 Avg rating0 Votes
Article ID: iaor1990106
Country: United Kingdom
Volume: 17
Start Page Number: 255
End Page Number: 263
Publication Date: Mar 1990
Journal: Computers and Operations Research
Authors:
Keywords: scheduling
Abstract:

Since the original work of Wagner and Whitin a number of planning horizon results and associated forward solution procedures for the dynamic lot-size problem have been published; among them the papers of Zabel, Lundin and Morton and Chand and Morton. This paper introduces ‘lot-trees’, a data structure that serves as a unifying framework for the exposition of these approaches, and at the same time leads to efficient implementations.

Reviews

Required fields are marked *. Your email address will not be published.