scholarly journals Minimizing the Maximum Expected Waiting Time in a Periodic Single-Server Queue with a Service-Rate Control

2019 ◽  
Vol 9 (3) ◽  
pp. 261-290 ◽  
Author(s):  
Ni Ma ◽  
Ward Whitt
Keyword(s):  
Waiting Time ◽  
Rate Control ◽  
Service Rate ◽  
Single Server ◽  
Single Server Queue ◽  
Server Queue ◽  
Expected Waiting Time

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

On the single server queue with preemptive service interruptions

1971 ◽  
Vol 8 (4) ◽  
pp. 835-837 ◽  
Author(s):  
İzzet Şahin
Keyword(s):  
Integral Equation ◽  
Waiting Time ◽  
Stochastic System ◽  
Single Server ◽  
Single Server Queue ◽  
Service Interruptions ◽  
Time Problem ◽  
Server Queue ◽  
Waiting Time Problem ◽  
Limiting Behaviour

In [4], the limiting behaviour of a stochastic system with two types of input was investigated by reducing the problem to the solution of an integral equation. In this note we use the same approach to study the equilibrium waiting time problem for the general single server queue with preemptive service interruptions. (For a comprehensive account of the existing literature on queues with service interruptions we refer to [2] and [3].)

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.

Waiting time and workload in queues with periodic Poisson input

1989 ◽  
Vol 26 (02) ◽  
pp. 390-397 ◽  
Author(s):  
Austin J. Lemoine
Keyword(s):  
Differential Equation ◽  
Waiting Time ◽  
Arrival Rate ◽  
Time Of Day ◽  
Single Server ◽  
Single Server Queue ◽  
Poisson Input ◽  
Service Distribution ◽  
Server Queue ◽  
General Service

This paper develops moment formulas for asymptotic workload and waiting time in a single-server queue with periodic Poisson input and general service distribution. These formulas involve the corresponding moments of waiting-time (workload) for the M/G/1 system with the same average arrival rate and service distribution. In certain cases, all the terms in the formulas can be computed exactly, including moments of workload at each ‘time of day.' The approach makes use of an asymptotic version of the Takács [12] integro-differential equation, together with representation results of Harrison and Lemoine [3] and Lemoine [6].

scholarly journals An M/G/1 queue with multiple types of feedback and gated vacations

1997 ◽  
Vol 34 (03) ◽  
pp. 773-784 ◽  
Author(s):  
Onno J. Boxma ◽  
Uri Yechiali
Keyword(s):  
Waiting Time ◽  
Service Time ◽  
Queue Length ◽  
Time Distribution ◽  
Single Server ◽  
Service Time Distribution ◽  
Waiting Time Distribution ◽  
Single Server Queue ◽  
Server Queue ◽  
Poisson Arrivals

This paper considers a single-server queue with Poisson arrivals and multiple customer feedbacks. If the first service attempt of a newly arriving customer is not successful, he returns to the end of the queue for another service attempt, with a different service time distribution. He keeps trying in this manner (as an ‘old' customer) until his service is successful. The server operates according to the ‘gated vacation' strategy; when it returns from a vacation to find K (new and old) customers, it renders a single service attempt to each of them and takes another vacation, etc. We study the joint queue length process of new and old customers, as well as the waiting time distribution of customers. Some extensions are also discussed.

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.

Sign in / Sign up

Export Citation Format

Share Document