COMPUTATIONAL APPROACH FOR TRANSIENT BEHAVIOUR OF M/M (a, b) /1 BULK SERVICE QUEUEING SYSTEM WITH MULTIPLE VACATION AND VARIABLE SERVICE RATE

2020 ◽  
Vol 7 (11) ◽  
Keyword(s):  
Queueing System ◽  
Computational Approach ◽  
Service Rate ◽  
Transient Behaviour ◽  
Multiple Vacation ◽  
Bulk Service

Computation of the stationary distribution of the queue size in an M/G/1 queueing system with variable service rate

1980 ◽  
Vol 17 (2) ◽  
pp. 515-522 ◽  
Author(s):  
A. Federgruen ◽  
H. C. Tijms
Keyword(s):  
Stationary Distribution ◽  
Queueing System ◽  
Computational Approach ◽  
Service Rate ◽  
Queue Size ◽  
Stationary Probabilities

This paper presents a simple and computationally tractable method which recursively computes the stationary probabilities of the queue size in an M/G/1 queueing system with variable service rate. For each service two possible service types are available and the service rule is characterized by two switch-over levels. The computational approach discussed in this paper can be applied to a variety of queueing problems.

Computation of the stationary distribution of the queue size in an M/G/1 queueing system with variable service rate

1980 ◽  
Vol 17 (02) ◽  
pp. 515-522 ◽  
Author(s):  
A. Federgruen ◽  
H. C. Tijms
Keyword(s):  
Stationary Distribution ◽  
Queueing System ◽  
Computational Approach ◽  
Service Rate ◽  
Queue Size ◽  
Stationary Probabilities

This paper presents a simple and computationally tractable method which recursively computes the stationary probabilities of the queue size in an M/G/1 queueing system with variable service rate. For each service two possible service types are available and the service rule is characterized by two switch-over levels. The computational approach discussed in this paper can be applied to a variety of queueing problems.

Optimal Thresholds of an Infinite Buffer Discrete-Time Two-Server System with Triadic Policy

2011 ◽  
Vol 2 (4) ◽  
pp. 75-88
Author(s):  
Veena Goswami ◽  
G. B. Mund
Keyword(s):  
Discrete Time ◽  
Queueing System ◽  
Minimum Cost ◽  
Service Rate ◽  
Closed Form Solutions ◽  
Optimal Thresholds ◽  
Optimal Service ◽  
Number Of Customers ◽  
System Operating ◽  
Server System

This paper analyzes a discrete-time infinite-buffer Geo/Geo/2 queue, in which the number of servers can be adjusted depending on the number of customers in the system one at a time at arrival or at service completion epoch. Analytical closed-form solutions of the infinite-buffer Geo/Geo/2 queueing system operating under the triadic (0, Q N, M) policy are derived. The total expected cost function is developed to obtain the optimal operating (0, Q N, M) policy and the optimal service rate at minimum cost using direct search method. Some performance measures and sensitivity analysis have been presented.

Sign in / Sign up

Export Citation Format

Share Document