Optimization of Batch Ordering under Deterministic Variable Demand

Salah E. Elmaghraby and Vishwas Y. Bawle
Additional contact information
Salah E. Elmaghraby: North Carolina State University
Vishwas Y. Bawle: American Natural Gas Service Company, Detroit, Michigan

Management Science, 1972, vol. 18, issue 9, 508-517

Abstract: We 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.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.9.508 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:18:y:1972:i:9:p:508-517

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().