Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

A Machine-Job Scheduling Model

George B. Dantzig
Management Science
Vol. 6, No. 2 (Jan., 1960), pp. 191-196
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/2627006
Page Count: 6
  • Download ($30.00)
  • Cite this Item
A Machine-Job Scheduling Model
Preview not available

Abstract

This paper makes use of a device proposed by Fulkerson and Ford for maximal multi-commodity network flows [1]. 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 [2], [3], [4], [6].

Page Thumbnails

  • Thumbnail: Page 
191
    191
  • Thumbnail: Page 
192
    192
  • Thumbnail: Page 
193
    193
  • Thumbnail: Page 
194
    194
  • Thumbnail: Page 
195
    195
  • Thumbnail: Page 
196
    196