Optimal Power-of-Two Replenishment Strategies in Capacitated General Production/Distribution Networks

A. Federgruen and Yusheng Zheng
Additional contact information
A. Federgruen: Graduate School of Business, Columbia University, New York, New York 10027

Management Science, 1993, vol. 39, issue 6, 710-727

Abstract: In this paper we develop a model for a capacitated production/distribution network of general (but acyclic) topology with a general bill of materials, as considered in MRP (Material Requirement Planning) or DRP (Distribution Requirement Planning) systems. This model assumes stationary, deterministic demand rates and a standard stationary cost structure; it is a generalization of the uncapacitated model treated in the seminal papers of Maxwell and Muckstadt (1985) and Roundy (1986). The capacity constraints consist of bounds on the frequency with which individual items can or need to be replenished. We derive a pair of simple and efficient algorithms capable of determining an optimal power-of-two policy. These algorithms consist of a limited number of maximum flow computations in networks closely related to the production/distribution network. The complexity of these algorithms, even when applied to the uncapacitated model, compares favorably with that of the existing alternative solution methods.

Keywords: general production/distribution networks; capacity constraints; power-of-two policies (search for similar items in EconPapers)
Date: 1993
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.39.6.710 (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:39:y:1993:i:6:p:710-727

Access Statistics for this article

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