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

A Machine-Job Scheduling Model

Author

Listed:
  • George B. Dantzig

    (The RAND Corporation)

Abstract

This paper makes use of a device proposed by Fulkerson and Ford for maximal multi-commodity network flows (Ford, L. R. Jr., D. R. Fulkerson. 1958. A suggested computation for maximal multi-commodity network flows. The RAND Corporation, Paper P-1114, March 27, 1958. Also Management Sci. 5(1) 97-101.). A machine-job scheduling model is formulated that avoids the usual in-process inventories and thereby has fewer equations. The activities are the possible sequence for each job of machine steps and interspersed delays; this, of course, greatly multiplies the number of activities. However, a compact network representation of the set of possible activities is developed which permits generating just the activity to enter the basis on each iteration without explicitly generating the others. This is done by using one of the efficient procedures that now exist for computing the shortest route through a network (Dantzig, George B. 1960. On the shortest route through a network. Management Sci. 6(2); Moore, E. F. The shortest path through a maze. Unpublished mimeographed report, 16 pages; Bellman, Richard. 1958. On a routing problem. JORSA, XVI(1) 87-90.), (Ford, L. R. Jr. 1956. Network flow theory. The RAND Corporation, Paper P-923).

Suggested Citation

  • George B. Dantzig, 1960. "A Machine-Job Scheduling Model," Management Science, INFORMS, vol. 6(2), pages 191-196, January.
    • Handle: RePEc:inm:ormnsc:v:6:y:1960:i:2:p:191-196
    DOI: 10.1287/mnsc.6.2.191
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.6.2.191
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.6.2.191?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:6:y:1960:i:2:p:191-196. 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.