A Network Approach to a Multi-Facility, Multi-Product Production Scheduling Problem Without Backordering

Robert C. Dorsey, Thom J. Hodgson and H. Donald Ratliff
Additional contact information
Robert C. Dorsey: Tennessee Eastman Company, Kingsport
Thom J. Hodgson: University of Florida, Gainesville
H. Donald Ratliff: University of Florida, Gainesville

Management Science, 1975, vol. 21, issue 7, 813-822

Abstract: A multi-product, multi-facility production scheduling problem is considered over a finite planning horizon. The horizon consists of discrete production periods during each of which at most one product can be assigned to each facility. Product demand rates are assumed to be constant over a period but not necessarily identical in all periods. All demands must be met without allowing backorders. The problem objective is to determine an assignment of products to facilities over the horizon which minimizes the sum of production and inventory carrying charges. The problem is formulated as a network flow problem for which efficient solution procedures are known. However, for an important special case a single pass algorithm is given which is more efficient than the standard flow algorithms.

Date: 1975
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.21.7.813 (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:21:y:1975:i:7:p:813-822

Access Statistics for this article

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