Production‐allocation scheduling and capacity expansion using network flows under uncertainty

Juan Prawda

Naval Research Logistics Quarterly, 1973, vol. 20, issue 3, 517-531

Abstract: This paper extends Connors and Zangwill's work in network flows under uncertainty to the convex costs case. In this paper the extended network flow under uncertainty algorithm is applied to compute N‐period production and delivery schedules of a single commodity in a two‐echelon production‐inventory system with convex costs and low demand items. Given an initial production capacity for N periods, the optimal production and delivery schedules for the entire N periods are characterized by the flows through paths of minimal expected discounted cost in the network As a by‐product of this algorithm the multi‐period stochastic version of the parametric budget problem for the two‐echelon production‐inventory system is solved.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800200312

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:navlog:v:20:y:1973:i:3:p:517-531

Access Statistics for this article

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