Service-adaptive multi-type repairman problems
Our rough guess is there are 6,250 words in this book.
At a pace averaging 250 words per minute, this book will take 0 hours and 25 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
- Morrison, John A. - Contributor
- Silveira, Rogerio G. - Contributor
- Naval Postgraduate School (U.S.). Dept. of Operations Research - Contributor
Publication
1991 - Naval Postgraduate School, Monterey, Calif, California
Language
English
Word Count
6,250 words, Guess
Page Count
25 pages
Identifiers
- Internet Archiveserviceadaptivem00gave
- Open LibraryOL25507699M
Alternate Titles
- NPS-OR-91-11.
Description
The classical repairman problem, cf. Feller (1967) is generalized to consider r failure-prone machine types, each type having its own individual failure rate and also repair rate. Each failed machine joins its type queue, and is repaired by a single server. Several dynamic service priority schemes are considered that approximate first-come, first-served, longest-line first, and least-available first. A heavy-traffic asymptotic analysis determines approximations to the time dependent mean and covariance of individual type queue lengths, and shows that the marginal joint distribution of queue lengths is approximately Ornstein-Uhlenbeck. Numerical illustrations of approximation accuracy are provided, as are suggested applications to computer performance and manufacturing systems analysis.
Subjects
Topics
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!