In a recent paper, Fisher et al. (2001) present a method tomitigate end-effects in lot sizing by including a valuation term for end-of-horizon inventory in the objective function of the short-horizon model. Computational tests show that the proposed method outperforms the Wagner-Whitin algorithm and the Silver-Meal heuristic, under several demand patterns, within a rolling horizon framework. We replicate the computational tests also including a straightforward method that assumes the same knowledge about future demand as the ending inventory valuation method. Our results indicate that the superior performance reported by Fisher et al. is to a large extent due to the fact that their method assumes that quite accurate knowledge about future demand is available, whereas the traditional methods do not use any information about demand beyond the short model horizon. Moreover, when quite accurate knowledge about future demand is indeed available, our results suggest that for some demand patterns, ending inventory valuation is not the most effective way to use this knowledge. Furthermore, we point out a minor mistake in the results reported by Fisher et al.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Heuvel, W. van den & Wagelmans, A.P.M., 2002.
"A Note on Ending Inventory Valuation in Multiperiod Production Scheduling,"
Research Paper
ERS-2002-63-LIS Revision_, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus Uni.
[Downloadable!]
Find related papers by JEL classification: C61 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Optimization Techniques; Programming Models; Dynamic Analysis
This paper has been announced in the following NEP Reports:
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: