Allocation of jobs to unequally-capable processors
a planning approach
Our rough guess is there are 7,250 words in this book.
At a pace averaging 250 words per minute, this book will take 0 hours and 29 minutes to read. With a half hour per day, this will take 1 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Jacobs, Patricia A. - Contributor
- Becker, Kevin J. - Contributor
- Lawphongpanich, Siriphong, 1956- - Contributor
- Naval Postgraduate School (U.S.). Dept. of Operations Research - Contributor
Publication
1996 - Naval Postgraduate School, Monterey, Calif, California
Language
English
Word Count
7,250 words, Guess
Page Count
29 pages
Identifiers
- Internet Archiveallocationofjobs00gave
- Open LibraryOL25499607M
Alternate 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.
Subjects
Topics
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!