Walking-Distance Introduced Queueing Theory
We introduce the effect of delay in walking from the head of the queue to the service windows in the queueing theory, and obtain the suitable type of queueing system under various conditions. When there are plural service windows, the queueing theory indicates that a fork-type queue, which collects people into a single queue, is more efficient than a parallel-type queue, i.e., queues for each service windows. However, in the walking-distance introduced queueing theory, we find that the parallel-type queue is more efficient when sufficiently many people are waiting in queues, and service time is shorter than walking time. We also consider the situation where there are two kinds of people, whose service time is short and long. The analytical result says that we can decrease people’s waiting time and their stress by setting up queues for each kind of people separately.
KeywordsService Time Cellular Automaton Service Rate Queueing System Throughput Rate
Unable to display preview. Download preview PDF.
- 1.Erlang, A.K.: The theory of probabilities and telephone conversations. Nyt. Tidsskr. Mat. Ser. B 20, 33–39 (1909)Google Scholar
- 6.Kasahara, S.: Towards Queueing Theory for the Internet Design. Technical Report of IEICE 101(649), 25–30 (2002)Google Scholar
- 13.Nishinari, K., Kirchner, A., Namazi, A., Schadschneider, A.: Nonmembers: Extended Floor Field CA Model for Evacuation Dynamics. IEICE Transactions on Information and Systems E87-D(3), 726–732 (2004)Google Scholar