Optimization of Batch Ordering under Deterministic Variable Demand
AbstractWe consider the problem of the optimal ordering schedule to satisfy a given demand pattern over a finite planning horizon when ordering must be in batches of size Q > 1, with and without "setup" cost. A dynamic programming model is constructed. The number of stages are minimized through the characterization of a "complete" set of periods in which ordering must take place and through consideration of the role of initial inventory. The state space and the decision space at each stage are also minimized through considerations of dominance, bounding and feasibility relative to established properties of the optimal schedule. All this results in a most computational efficient algorithm.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 18 (1972)
Issue (Month): 9 (May)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, 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 University Rotterdam.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If references are entirely missing, you can add them using this form.