๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A multi-server queueing model with locking

โœ Scribed by Ivo Adan; Ton de Kok; Jacques Resing


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
179 KB
Volume
116
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

โœฆ Synopsis


In this paper we analyse a multi-server queueing model with locking. The model is motivated by a situation we encountered at a maintenance facility for trains. Maintenance is done at parallel tracks, where each track oers space to two trains. Trains can enter and leave the tracks from one and the same side only. This gives rise to locking of the front train: in order to leave the maintenance track the front train has to wait till maintenance of the back train (if there is one) has also been completed. Hence, part of the maintenance (or track) capacity is lost. The queueing model is used to investigate the loss of capacity and its eect on sojourn times. The performance of this system is also compared with other designs. A surprising result is that in light trac it is better to use only half of the track capacity by allowing no more than one train at a maintenance track.


๐Ÿ“œ SIMILAR VOLUMES


Analysis of multi-server queues with sta
โœ Xiuli Chao; Yiqiang Q. Zhao ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 731 KB

In this paper, we consider GI/M/c queues with two classes of vacation mechanisms: Station vacation and server vacation. In the first one, all the servers take vacation simultaneously whenever the system becomes empty, and they also return to the system at the same time, i.e., station vacation is a g