Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1703537 | Applied Mathematical Modelling | 2014 | 13 Pages |
Abstract
We study an assembly-like queueing system one of whose queues has items with generally distributed time-constraints, where this system has a single server providing services using each item individually. It is well-known that analysis of a queueing system which has items with time-constraint (i.e., impatient items) is difficult since the analytical model must involve all the departure times of these impatient items. We therefore propose to employ the techniques of Whitt's approximation and show the method for obtaining the stationary distribution of the model. Through some simulation experiments, we discuss the validation of our approximation model, and show that the approximation is accurate in various kinds of situations (e.g., service time distribution and the number of queues).
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Yutaka Sakuma, Atsushi Inoie,