scholarly journals Prediction of Two-Node Tandem Queue with Feedback Having State and Time Dependent Service Rates

2020 ◽  
Vol 1531 ◽  
pp. 012063
Author(s):  
Ankita Roy Chowdhury ◽  
Indra
Keyword(s):  
Time Dependent ◽  
Tandem Queue ◽  
Service Rates

scholarly journals An M/M/c queue with queueing-time dependent service rates

2021 ◽  
Author(s):  
Bernardo D’Auria ◽  
Ivo J.B.F. Adan ◽  
Ren Bekker ◽  
Vidyadhar Kulkarni
Keyword(s):  
Time Dependent ◽  
Service Rates ◽  
Queueing Time

Time-dependent solution and optimal control of a bulk service queue

1997 ◽  
Vol 34 (01) ◽  
pp. 258-266
Author(s):  
Shokri Z. Selim
Keyword(s):  
Queueing System ◽  
Maximum Size ◽  
Time Dependent ◽  
Optimal Service ◽  
Bulk Service ◽  
Service Rates ◽  
Finite Time Horizon ◽  
Number Of Customers ◽  
Time Dependent Solution ◽  
Dependent Probability

We consider the queueing system denoted by M/MN /1/N where customers are served in batches of maximum size N. The model is motivated by a traffic application. The time-dependent probability distribution for the number of customers in the system is obtained in closed form. The solution is used to predict the optimal service rates during a finite time horizon.

On interchangeability for exponential single-server queues in tandem

1990 ◽  
Vol 27 (2) ◽  
pp. 459-464 ◽  
Author(s):  
Masaaki Kijima ◽  
Naoki Makimoto
Keyword(s):  
Direct Proof ◽  
Single Server ◽  
Tandem Queue ◽  
Exponential Distributions ◽  
Departure Process ◽  
Single Server Queues ◽  
Service Rates

Consider two exponential single-server queues in tandem and suppose that service rates of customer n are λ n and μ n respectively. In this note, a simple and direct proof is given of the fact that the departure process from the tandem queue is statistically unaffected when the service rates are interchanged if λ n – μn is independent of n. The proof is based only on the memoryless property of exponential distributions.

On interchangeability for exponential single-server queues in tandem

1990 ◽  
Vol 27 (02) ◽  
pp. 459-464 ◽  
Author(s):  
Masaaki Kijima ◽  
Naoki Makimoto
Keyword(s):  
Direct Proof ◽  
Single Server ◽  
Tandem Queue ◽  
Exponential Distributions ◽  
Departure Process ◽  
Single Server Queues ◽  
Service Rates

Consider two exponential single-server queues in tandem and suppose that service rates of customer n are λ n and μ n respectively. In this note, a simple and direct proof is given of the fact that the departure process from the tandem queue is statistically unaffected when the service rates are interchanged if λ n – μn is independent of n. The proof is based only on the memoryless property of exponential distributions.

Time-dependent solution and optimal control of a bulk service queue

1997 ◽  
Vol 34 (1) ◽  
pp. 258-266 ◽  
Author(s):  
Shokri Z. Selim
Keyword(s):  
Queueing System ◽  
Maximum Size ◽  
Time Dependent ◽  
Optimal Service ◽  
Bulk Service ◽  
Service Rates ◽  
Finite Time Horizon ◽  
Number Of Customers ◽  
Time Dependent Solution ◽  
Dependent Probability

We consider the queueing system denoted by M/MN/1/N where customers are served in batches of maximum size N. The model is motivated by a traffic application. The time-dependent probability distribution for the number of customers in the system is obtained in closed form. The solution is used to predict the optimal service rates during a finite time horizon.

Sign in / Sign up

Export Citation Format

Share Document