Note: Dynamic lot sizing for a finite rate input process

Roger M. Hill

Naval Research Logistics (NRL), 1997, vol. 44, issue 2, 221-228

Abstract: The basic single‐product dynamic lot‐sizing problem involves determining the optimal batch production schedule to meet a deterministic, discrete‐in‐time, varying demand pattern subject to linear setup and stockholding costs. The most widely known procedure for deriving the optimal solution is the Wagner‐Whitin algorithm, although many other approaches have subsequently been developed for tackling the same problem. The objective of this note is to show how these procedures can readily be adapted when the input is a finite rate production process. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 221–228, 1997

Date: 1997
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(199703)44:23.0.CO;2-B

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:wly:navres:v:44:y:1997:i:2:p:221-228

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().