A study of some M[x]/G/1 type queues with random breakdowns and bernouilli schedule server vacations based on a single vacation policy [PDF]
, 2008 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Queueing systems arise in modelling of many practical applications related to computer sciences, telecommunication networks, manufacturing and production ...
Maraghi, Farzana Abdulla
core +7 more sources
Approximate analysis of non-stationary loss queues and networks of loss queues with general service time distributions [PDF]
, 2011 A Fixed Point Approximation (FPA) method has recently been suggested for non-stationary analysis of loss queues and networks of loss queues with Exponential service times.
Worthington, D. J. +7 more
core +1 more source
Time-dependent analysis of virtual waiting time behaviour in discrete time queues [PDF]
, 2005 Discrete time queueing models have been shown previously to be of practical use for modelling the approximate time-dependent behaviour of queue length in systems of the form M(t)/G/c.
Wall, A, Worthington, D J
core +4 more sources
Appointment capacity planning in specialty clinics: a queueing approach [PDF]
, 2015 Specialty clinics provide specialized care for patients referred by primary care physicians, emergency departments, or other specialists. Urgent patients must often be seen on the referral day, whereas nonurgent referrals are typically booked an ...
Izady, N., Izady, Navid
core +1 more source
Setting staffing requirements for time-dependent queueing networks: the case of accident and emergency departments [PDF]
, 2012 An incentive scheme aimed at reducing patients’ waiting times in accident and emergency departments was introduced by the UK government in 2000. It requires 98% of patients to be discharged, transferred, or admitted to inpatient care within 4 hours of ...
Dave Worthington +6 more
core +1 more source
Tail asymptotics for processor sharing queues [PDF]
, 2003 The basic queueing system considered in this paper is the M/G/1 processor-sharing queue with or without impatience and with finite or infinite capacity.
Zwart, A.P. +8 more
core +2 more sources
Interacting queues in heavy traffic [PDF]
, 2010 We consider a system of parallel queues with Poisson arrivals and exponentially distributed service requirements. The various queues are coupled through their service rates, causing a complex dynamic interaction.
Morrison, J.A. +6 more
core +2 more sources
Departure processes from MAP/PH/1 queues [PDF]
, 1999 A MAP/PH/1 queue is a queue having a Markov arrival process (MAP), and a single server with phase-type (PH -type) distributed service time. This thesis considers the departure process from these type of queues.
Green, David Anthony
core
Tandem queues with deterministic service times [PDF]
, 1992 In this paper we consider a tandem queueing model for a sequence of multiplexers at the edge of an ATM network. All queues of the tandem queueing model have unit service times.
Resing, J.A.C. +5 more
core +2 more sources
Tandem queues with deterministic service times
, 1994 In this paper we consider a tandem queueing model for a sequence of multiplexers at the edge of an ATM network. All queues of the tandem queueing model have unit service times.
Resing, J.A.C., Boxma, O.J.
core +1 more source