Accession Number : AD0762846

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

Descriptive Note : Research rept.,

Corporate Author : CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP

Personal Author(s) : Balachandran,V.

Report Date : NOV 1972

Pagination or Media Count : 29

Abstract : The paper investigates assignment of tasks characterized by a parameter-matrix in a network of functionally similar computers. This is formulated by a periodic review model using Boolean variables, based on optimization of an utility function over a constraint set. A computationally efficient integer-generalized transportation model is applicable due to existance of relative efficiencies of computers for jobs. Since a job is to be processed exclusively by one computer, it is shown that an optimum solution to this is a basic feasible solution to a slightly different generalized transportation problem. Then the branch and bound solution procedure yields the one-source requirement. An operator theory is applied to make necessary post-optimization. (Author)

Descriptors :   (*MATHEMATICAL PROGRAMMING, OPTIMIZATION), (*DATA PROCESSING, SCHEDULING), QUEUEING THEORY, MATHEMATICAL LOGIC, MULTIPLE OPERATION, ALGORITHMS

Subject Categories : Operations Research
      Computer Hardware
      Computer Systems

Distribution Statement : APPROVED FOR PUBLIC RELEASE