On a General Solution of the Deterministic Lot Size Problem with Time-Proportional Demand

Michael Resh, Moshe Friedman and Lineu C. Barbosa
Additional contact information
Michael Resh: Israel Ministry of Communications, Tel-Aviv, Israel
Moshe Friedman: Arizona State University, Tempe, Arizona
Lineu C. Barbosa: IBM Research Laboratory, San Jose, California

Operations Research, 1976, vol. 24, issue 4, 718-725

Abstract: We reconsider the classical lot-size model with the assumption that demand rate is deterministic, starts at the origin, and linearly increases with time. Two relevant costs are involved: carrying cost and replenishment cost. The planning horizon is finite and known. The problem is to find the optimal schedule of replenishments, i.e., their number and the schedule of time intervals between consecutive orders. Mathematically, we have to find an integer m and the values of m continuous variables so as to minimize the total carrying and replenishments costs. We prove that for a givers number of replenishments m , there exists a unique vector of m time intervals that minimizes the total cost function. It is further shown that the total carrying cost obtained after substituting the optimal value of that vector is a convex function of m . The algorithm that determines the unique optimal value of m and the unique optimal scheduling of replenishments for m employs these mathematical results. Finally, we investigate the asymptotic properties of the model when the planning horizon is infinite.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.24.4.718 (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:oropre:v:24:y:1976:i:4:p:718-725

Access Statistics for this article

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