Constrained Average Cost Markov Decision Chains

1993 ◽  
Vol 7 (1) ◽  
pp. 69-83 ◽  
Author(s):  
Linn I. Sennott
Keyword(s):  
Rate Control ◽  
Operating Cost ◽  
Service Rate ◽  
Single Server ◽  
Single Server Queue ◽  
Stationary Policy ◽  
Server Queue ◽  
Markov Decision ◽  
Average Operating ◽  
Holding Cost

A Markov decision chain with denumerable state space incurs two types of costs — for example, an operating cost and a holding cost. The objective is to minimize the expected average operating cost, subject to a constraint on the expected average holding cost. We prove the existence of an optimal constrained randomized stationary policy, for which the two stationary policies differ on at most one state. The examples treated are a packet communication system with reject option and a single-server queue with service rate control.

scholarly journals Dynamic service rate control for a single-server queue with Markov-modulated arrivals

2013 ◽  
Vol 60 (8) ◽  
pp. 661-677 ◽  
Author(s):  
Ravi Kumar ◽  
Mark E. Lewis ◽  
Huseyin Topaloglu
Keyword(s):  
Rate Control ◽  
Service Rate ◽  
Single Server ◽  
Single Server Queue ◽  
Server Queue ◽  
Markov Modulated

The single-server queue with random service output

1975 ◽  
Vol 12 (04) ◽  
pp. 763-778 ◽  
Author(s):  
O. J. Boxma
Keyword(s):  
Service Process ◽  
Service Rate ◽  
Single Server ◽  
Queueing Model ◽  
Single Server Queue ◽  
Independent Increments ◽  
Server Queue ◽  
Work Done

In this paper a problem arising in queueing and dam theory is studied. We shall consider a G/G*/1 queueing model, i.e., a G/G/1 queueing model of which the service process is a separable centered process with stationary independent increments. This is a generalisation of the well-known G/G/1 model with constant service rate. Several results concerning the amount of work done by the server, the busy cycles etc., are derived, mainly using the well-known method of Pollaczek. Emphasis is laid on the similarities and dissimilarities between the results of the ‘classical’ G/G/1 model and the G/G*/1 model.

Single-Server Queue System of Shuttle Bus Performance: Federal University of Technology Akure as Case Study

2019 ◽  
Vol 5 (3) ◽  
pp. 9-14
Author(s):  
Sidiq Okwudili Ben
Keyword(s):  
Laplace Transform ◽  
Poisson Process ◽  
Service Rate ◽  
Single Server ◽  
Single Server Queue ◽  
Queue System ◽  
University Of Technology ◽  
Server Queue

This study has examined the performance of University transport bus shuttle based on utilization using a Single-server queue system which occur if arrival and service rate is Poisson distributed (single queue) (M/M/1) queue. In the methodology, Single-server queue system was modelled based on Poisson Process with the introduction of Laplace Transform. It is concluded that the performance of University transport bus shuttle is 96.6 percent which indicates a very good performance such that the supply of shuttle bus in FUTA is capable of meeting the demand.

The single-server queue with random service output

1975 ◽  
Vol 12 (4) ◽  
pp. 763-778 ◽  
Author(s):  
O. J. Boxma
Keyword(s):  
Service Process ◽  
Service Rate ◽  
Single Server ◽  
Queueing Model ◽  
Single Server Queue ◽  
Independent Increments ◽  
Server Queue ◽  
Work Done

In this paper a problem arising in queueing and dam theory is studied. We shall consider a G/G*/1 queueing model, i.e., a G/G/1 queueing model of which the service process is a separable centered process with stationary independent increments. This is a generalisation of the well-known G/G/1 model with constant service rate.Several results concerning the amount of work done by the server, the busy cycles etc., are derived, mainly using the well-known method of Pollaczek. Emphasis is laid on the similarities and dissimilarities between the results of the ‘classical’ G/G/1 model and the G/G*/1 model.

scholarly journals Application of Single-Server Queue System in Performance Analysis of Shuttle Bus Operation: A Case Study of Federal University of Technology Akure

2019 ◽  
Vol 1 (2) ◽  
pp. 46-53
Author(s):  
Kanyio Olufunto Adedotun
Keyword(s):  
Economic Cost ◽  
Service Rate ◽  
Single Server ◽  
Single Server Queue ◽  
Peak Period ◽  
Queue System ◽  
University Of Technology ◽  
Server Queue ◽  
Poisson Arrivals

This study has examined the performance of University transport bus shuttle based on utilization using a Single-server queue system which occur if arrival and service rate is Poisson distributed (single queue) (M/M/1) queue. In the methodology, Single-server queue system was modelled based on Poisson Process with the introduction of Laplace Transform. Also, PASTA was introduced in queuing systems with Poisson arrivals. It is concluded that the performance of University transport bus shuttle is 93 percent which indicates a very good performance such that the supply of shuttle bus in FUTA is capable of meeting the demand. This study can be improved upon by examining the peak and off-peak period of traffic in the two major corridors (North gate and South gate) of FUTA, the economic cost of operating bus shuttle services can also be examined.

Sign in / Sign up

Export Citation Format

Share Document