This paper considers two service stages in tandem with infinite queue capacity in front of each stage. There is a single server who performs the service in both stages by switching from one stage to the other when the number of customers in the active stage reaches the value zero. The arrival process is assumed to be Poisson and the service processes are independent renewal processes. The state probabilities are obtained in the steady-state case. In addition for the steady-state case, the Laplace-Stieltjes transform is obtained for the time a customer waits until the beginning of service in each stage, for the busy period of the server, and for the busy period of each stage.
[1]
Rosser T. Nelson.
Labor Assignment as a Dynamic Control Problem
,
1966,
Oper. Res..
[2]
Martin Eisenberg.
Two Queues with Changeover Times
,
1971,
Oper. Res..
[3]
Martin Eisenberg,et al.
Queues with Periodic Service and Changeover Time
,
1972,
Oper. Res..
[4]
William L. Maxwell,et al.
Queuing with Alternating Priorities
,
1965
.
[5]
Robert B. Cooper,et al.
Introduction to Queueing Theory
,
1973
.
[6]
Lajos Takács.
Two Queues Attended by a Single Server
,
1968,
Oper. Res..