Allocation of Jobs to Unequally-Capable Processors: A Planning Approach.

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1996
Accession Number
ADA316928

Entities

People

  • Donald P. Gaver Jr.
  • Kevin Becker
  • Patricia A. Jacobs
  • Siriphong Lawphongpanich

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Information Operations
  • Integer Programming
  • Intensity
  • Interdisciplinary Science
  • Mathematical Programming
  • Mathematics
  • Nonlinear Programming
  • Operations Research
  • Optimization
  • Probability
  • Quadratic Programming
  • Random Variables
  • Systems Science
  • Training

Readers

  • Database Systems and Applications
  • Instructional Design and Training Evaluation.
  • Operations Research