The dynamic lot-sizing model with backlogging: A simple O(nlogn) algorithm and minimal forecast horizon procedure

The dynamic lot-sizing model with backlogging: A simple O(nlogn) algorithm and minimal forecast horizon procedure

0.00 Avg rating0 Votes
Article ID: iaor19932117
Country: United States
Volume: 40
Issue: 4
Start Page Number: 459
End Page Number: 478
Publication Date: Jun 1993
Journal: Naval Research Logistics
Authors: ,
Keywords: computational analysis
Abstract:

The authors develop a simple O(nlogn) solution method for the standard lot-sizing model with backlogging and a study horizon of n periods. Production costs are fixed plus linear and holding and backlogging costs are linear with general time-dependent parameters. The algorithm has linear [O(n)] time complexity for several important subclasses of the general model. The authors show how a slight adaptation of the algorithm can be used for the detection of a minimal forecast horizon and associated planning horizon. The adapted algorithm continues to have complexity O(nlogn) or O(n) for the above-mentioned subclasses of the general model.

Reviews

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