Algorithms for the design of finite-capacity service units

Algorithms for the design of finite-capacity service units

0.00 Avg rating0 Votes
Article ID: iaor19881267
Country: United States
Volume: 36
Issue: 2
Start Page Number: 147
End Page Number: 165
Publication Date: Apr 1989
Journal: Naval Research Logistics
Authors: ,
Keywords: facilities
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.

Reviews

Required fields are marked *. Your email address will not be published.