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.

An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks

V. Balachandran
Operations Research
Vol. 24, No. 4 (Jul. - Aug., 1976), pp. 742-759
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/169772
Page Count: 18
  • Download ($30.00)
  • Cite this Item
An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
Preview not available

Abstract

This paper investigates the assignment of tasks in a network of functionally similar computers. We formulate the problem by a periodic review model with Boolean variables. A computationally efficient, integer-generalized transportation model is applicable because of the existence of relative efficiencies of computers for jobs. Since a job is to be processed exclusively by one computer, we show that an optimal solution to this problem is a basic feasible solution to a slightly modified generalized transportation problem. A branch-and-bound solution procedure prevents possible splitting of a job among computers. We provide an algorithm and computational results.

Page Thumbnails

  • Thumbnail: Page 
742
    742
  • Thumbnail: Page 
743
    743
  • Thumbnail: Page 
744
    744
  • Thumbnail: Page 
745
    745
  • Thumbnail: Page 
746
    746
  • Thumbnail: Page 
747
    747
  • Thumbnail: Page 
748
    748
  • Thumbnail: Page 
749
    749
  • Thumbnail: Page 
750
    750
  • Thumbnail: Page 
751
    751
  • Thumbnail: Page 
752
    752
  • Thumbnail: Page 
753
    753
  • Thumbnail: Page 
754
    754
  • Thumbnail: Page 
755
    755
  • Thumbnail: Page 
756
    756
  • Thumbnail: Page 
757
    757
  • Thumbnail: Page 
758
    758
  • Thumbnail: Page 
759
    759