Allocation of jobs to unequally-capable processors
Subtitle: a planning approach
By: by Donald P. Gaver, Patricia A. Jacobs, Kevin Becker, Siriphong Lawphongpanich
Contributors: Jacobs, Patricia A.; Becker, Kevin J.; Lawphongpanich, Siriphong, 1956-; Naval Postgraduate School (U.S.). Dept. of Operations Research
Publisher: Naval Postgraduate School; Available from National Technical Information Service
Published: 1996
Place of publication: Monterey, Calif; Springfield, Va
Language: eng
Number of pages: 29
Subjects: JOBS; QUEUEING THEORY
Other titles: NPS-OR-96-010.
Description: This paper addresses the problem in which jobs of different types arrive at a system that      consists of a collection of individual and somewhat diverse processors. The processors      differ in that each may spedalize in one job type, but may also do others. Job types that      are totally incompatible with a processor have an infinite service on that processor, but      degrees of incompatibility may exist, and are modeled here. Using static queuing models,      several practical performance measures may be evaluated, and optimal allocation of      jobs to processors are obtained by solving linear and nonlinear programming problems.      To illustrate, several numerical examples are provided. It is shown that jobs are not      always most advantageously assigned to their most expert servers.
Notes: Cover title.

"NPS-OR-96-010."

"September 1996."

AD A316 928.

Includes bibliographical references (p. 21)

aq/aq cc:9116 02/26/97.