A Hybrid Algorithm for Simultaneous Scheduling of Production and Distribution in Multi-Echelon Structures

Jack F. Williams
Additional contact information
Jack F. Williams: University of Wyoming

Management Science, 1983, vol. 29, issue 1, 77-92

Abstract: This paper presents a dynamic programming algorithm for simultaneous determination of production batch sizes in an assembly network and distribution batch sizes in a conjoined distribution ("arborescent") network. The objective is to minimize average cost per period over an infinite horizon. Costs consist of processing costs at each node and linear holding costs for inventory. Final product demand rates may vary among the retail nodes, but at each retail node the demand rate is assumed to be known, constant, and continuous. All demand must be met; backorders are not permitted. The model can be used for a single product, or for several products that are temporarily combined for distribution, or for scheduling production in a system where several end products are produced from the same intermediate product, as in some biochemical manufacturing processes.

Keywords: inventory/production: deterministic models; dynamic programming: applications; production scheduling (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.29.1.77 (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:29:y:1983:i:1:p:77-92

Access Statistics for this article

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