Allocation of Jobs to Unequally-Capable Processors: A Planning Approach
Loading...
Authors
Gaver, Donald Paul
Jacobs, Patricia A.
Becker, Kevin J.
Lawphongpanich, Siriphong
Subjects
queuing models; allocation of jobs to unequal servers
Advisors
Date of Issue
1996-09
Date
1996-09
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
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
Type
Technical Report
Description
Series/Report No
Department
Operations Research
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
NPS-OR-96-010
Sponsors
Naval Postgraduate School, Monterey, CA.
Funder
NA
Format
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.