Analysis of a Finite Intermediate Waiting Room Tandem Queue Attended by a Moving Server with walking Time
Summary :
This paper considers a two-counter tandem queuing system attended by a moving server with walking time. The first queue capacity is infinite, but the second queue capacity is equal to a finite number, N. A walking time, with a general distribution is required whenever the server moves from one counter to the other. The server continues servicing at the first counter until N services have been effected without interruption, or until the first queue becomes empty, whichever comes first. After completing the services at the first counter, the server moves to the second counter, and it serves all of the calls in the second queue before coming back to the first counter. The arrival process is assumed to be Poission and the service processes are independent renewal processes. Under steady-state conditions, it tbtains a Laplace-Stieltjes transform for the total sojourn time a call stays in the system, until the completion of sequential services at the two counters. It also acquires the first moment of the server's cycle time, the server's occupancy and the walking time percentage.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E64-E No.9 pp.571-578
- Publication Date
- 1981/09/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Switching Systems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Tsuyoshi KATAYAMA, "Analysis of a Finite Intermediate Waiting Room Tandem Queue Attended by a Moving Server with walking Time" in IEICE TRANSACTIONS on transactions,
vol. E64-E, no. 9, pp. 571-578, September 1981, doi: .
Abstract: This paper considers a two-counter tandem queuing system attended by a moving server with walking time. The first queue capacity is infinite, but the second queue capacity is equal to a finite number, N. A walking time, with a general distribution is required whenever the server moves from one counter to the other. The server continues servicing at the first counter until N services have been effected without interruption, or until the first queue becomes empty, whichever comes first. After completing the services at the first counter, the server moves to the second counter, and it serves all of the calls in the second queue before coming back to the first counter. The arrival process is assumed to be Poission and the service processes are independent renewal processes. Under steady-state conditions, it tbtains a Laplace-Stieltjes transform for the total sojourn time a call stays in the system, until the completion of sequential services at the two counters. It also acquires the first moment of the server's cycle time, the server's occupancy and the walking time percentage.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e64-e_9_571/_p
Copy
@ARTICLE{e64-e_9_571,
author={Tsuyoshi KATAYAMA, },
journal={IEICE TRANSACTIONS on transactions},
title={Analysis of a Finite Intermediate Waiting Room Tandem Queue Attended by a Moving Server with walking Time},
year={1981},
volume={E64-E},
number={9},
pages={571-578},
abstract={This paper considers a two-counter tandem queuing system attended by a moving server with walking time. The first queue capacity is infinite, but the second queue capacity is equal to a finite number, N. A walking time, with a general distribution is required whenever the server moves from one counter to the other. The server continues servicing at the first counter until N services have been effected without interruption, or until the first queue becomes empty, whichever comes first. After completing the services at the first counter, the server moves to the second counter, and it serves all of the calls in the second queue before coming back to the first counter. The arrival process is assumed to be Poission and the service processes are independent renewal processes. Under steady-state conditions, it tbtains a Laplace-Stieltjes transform for the total sojourn time a call stays in the system, until the completion of sequential services at the two counters. It also acquires the first moment of the server's cycle time, the server's occupancy and the walking time percentage.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - Analysis of a Finite Intermediate Waiting Room Tandem Queue Attended by a Moving Server with walking Time
T2 - IEICE TRANSACTIONS on transactions
SP - 571
EP - 578
AU - Tsuyoshi KATAYAMA
PY - 1981
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E64-E
IS - 9
JA - IEICE TRANSACTIONS on transactions
Y1 - September 1981
AB - This paper considers a two-counter tandem queuing system attended by a moving server with walking time. The first queue capacity is infinite, but the second queue capacity is equal to a finite number, N. A walking time, with a general distribution is required whenever the server moves from one counter to the other. The server continues servicing at the first counter until N services have been effected without interruption, or until the first queue becomes empty, whichever comes first. After completing the services at the first counter, the server moves to the second counter, and it serves all of the calls in the second queue before coming back to the first counter. The arrival process is assumed to be Poission and the service processes are independent renewal processes. Under steady-state conditions, it tbtains a Laplace-Stieltjes transform for the total sojourn time a call stays in the system, until the completion of sequential services at the two counters. It also acquires the first moment of the server's cycle time, the server's occupancy and the walking time percentage.
ER -
English
