Algorithms for the Design of Finite Capacity Service Units

Authors

Srinivas R. Chakravarthy, Kettering UniversityFollow
Marcel F. Neuts, University of Arizona

Document Type

Article

Publication Date

1989

Publication Title

Naval Research Logistics

Abstract

Finite‐capacity queues arise naturally in many practical situations, notably in communications and manufacturing engineering. In this article, the matrix formalism of probability distributions of phase type is used to develop fast algorithms to compute various steady‐state distributions for the finite‐capacity PH/PH/1 queue. This algorithm is an important ingredient in solving nontraditional but significant design problems. Some of these are described as illustrative examples.

Volume

36

First Page

147

Last Page

165

DOI

10.1002/1520-6750(198904)36:2<147::AID-NAV3220360204>3.0.CO;2-U

ISSN

Online ISSN:1520-6750

Rights

© 1989 Wiley Periodicals, Inc., A Wiley Company

Recommended Citation

Chakravarthy, Srinivas R. and Neuts, Marcel F., "Algorithms for the Design of Finite Capacity Service Units" (1989). Industrial & Manufacturing Engineering Publications. 85.
https://digitalcommons.kettering.edu/industrialmanuf_eng_facultypubs/85