IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v21y1975i7p813-822.html
   My bibliography  Save this article

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

Author

Listed:
  • Robert C. Dorsey

    (Tennessee Eastman Company, Kingsport)

  • Thom J. Hodgson

    (University of Florida, Gainesville)

  • H. Donald Ratliff

    (University of Florida, Gainesville)

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.

Suggested Citation

  • Robert C. Dorsey & Thom J. Hodgson & H. Donald Ratliff, 1975. "A Network Approach to a Multi-Facility, Multi-Product Production Scheduling Problem Without Backordering," Management Science, INFORMS, vol. 21(7), pages 813-822, March.
  • Handle: RePEc:inm:ormnsc:v:21:y:1975:i:7:p:813-822
    DOI: 10.1287/mnsc.21.7.813
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.21.7.813
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.21.7.813?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:21:y:1975:i:7:p:813-822. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.