154 research outputs found
Estimating customer impatience in a service system with unobserved balking
This paper studies a service system in which arriving customers are provided
with information about the delay they will experience. Based on this
information they decide to wait for service or to leave the system. The main
objective is to estimate the customers' patience-level distribution and the
corresponding potential arrival rate, using knowledge of the actual
queue-length process only. The main complication, and distinguishing feature of
our setup, lies in the fact that customers who decide not to join are not
observed, but, remarkably, we manage to devise a procedure to estimate the load
they would generate. We express our system in terms of a multi-server queue
with a Poisson stream of customers, which allows us to evaluate the
corresponding likelihood function. Estimating the unknown parameters relying on
a maximum likelihood procedure, we prove strong consistency and derive the
asymptotic distribution of the estimation error. Several applications and
extensions of the method are discussed. The performance of our approach is
further assessed through a series of numerical experiments. By fitting
parameters of hyperexponential and generalized-hyperexponential distributions
our method provides a robust estimation framework for any continuous
patience-level distribution
Sharing delay information in service systems: a literature survey
Service providers routinely share information about upcoming waiting times with their customers, through delay announcements. The need to effectively manage the provision of these announcements has led to a substantial growth in the body of literature which is devoted to that topic. In this survey paper, we systematically review the relevant literature, summarize some of its key ideas and findings, describe the main challenges that the different approaches to the problem entail, and formulate research directions that would be interesting to consider in future work
Performance analysis of time-dependent queueing systems: survey and classification
Many queueing systems are subject to time-dependent changes in system parameters, such as the arrival
rate or number of servers. Examples include time-dependent call volumes and agents at inbound call
centers, time-varying air traffic at airports, time-dependent truck arrival rates at seaports, and cyclic message volumes in computer systems.There are several approaches for the performance analysis of queueing systems with deterministic parameter changes over time. In this survey, we develop a classification scheme that groups these approaches according to their underlying key ideas into (i) numerical and analytical solutions,(ii)approaches based on models with piecewise constant parameters, and (iii) approaches based on mod-ified system characteristics. Additionally, we identify links between the different approaches and provide a survey of applications that are categorized into service, road and air traffic, and IT systems
Pilot interaction with automated airborne decision making systems
An investigation was made of interaction between a human pilot and automated on-board decision making systems. Research was initiated on the topic of pilot problem solving in automated and semi-automated flight management systems and attempts were made to develop a model of human decision making in a multi-task situation. A study was made of allocation of responsibility between human and computer, and discussed were various pilot performance parameters with varying degrees of automation. Optimal allocation of responsibility between human and computer was considered and some theoretical results found in the literature were presented. The pilot as a problem solver was discussed. Finally the design of displays, controls, procedures, and computer aids for problem solving tasks in automated and semi-automated systems was considered
A single-server Markovian queuing system with discouraged arrivals and retention of reneged customers
Customer impatience has a very negative impact on the queuing system under
investigation. If we talk from business point of view, the firms lose their
potential customers due to customer impatience, which affects their business
as a whole. If the firms employ certain customer retention strategies, then
there are chances that a certain fraction of impatient customers can be
retained in the queuing system. A reneged customer may be convinced to stay
in the queuing system for his further service with some probability, say q
and he may abandon the queue without receiving the service with a probability
p(=1− q). A finite waiting space Markovian single-server queuing model with
discouraged arrivals, reneging and retention of reneged customers is studied.
The steady state solution of the model is derived iteratively. The measures
of effectiveness of the queuing model are also obtained. Some important
queuing models are derived as special cases of this model
Recommended from our members
Analysis of some batch arrival queueing systems with balking, reneging, random breakdowns, fluctuating modes of service and Bernoulli schedulled server vacations.
This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University LondonThe purpose of this research is to investigate and analyse some batch arrival queueing systems with Bernoulli scheduled vacation process and single server providing service. The study aims to explore and extend the work done on vacation and unreliable queues with a combination of assumptions like balking and re-service, reneging during vacations, time homogeneous random breakdowns and fluctuating modes of service. We study the steady state properties, and also transient behaviour of such queueing systems. Due to vacations the arriving units already in the system may abandon the system without receiving any service (reneging). Customers may decide not to join the queue when the server is in either working or vacation state (balking). We study this phenomenon in the framework of two models; a single server with two types of parallel services and two stages of service. The model is further extended with re-service offered instantaneously. Units which join the queue but leave without service upon the absence of the server; especially due to vacation is quite a natural phenomenon. We study this reneging behaviour in a queueing process with a single server in the context of Markovian and non-Markovian service time distribution. Arrivals are in batches while each customer can take the decision to renege independently. The non-Markovian model is further extended considering service time to follow a Gamma distribution and arrivals are due to Geometric distribution. The closed-form solutions are derived in all the cases. Among other causes of service interruptions, one prime cause is breakdowns. We consider breakdowns to occur both in idle and working state of the server. In this queueing system the transient and steady state analysis are both investigated. Applying the supplementary variable technique, we obtain the probability generating function of queue size at random epoch for the different states of the system and also derive some performance measures like probability of server‟s idle time, utilization factor, mean queue length and mean waiting time. The effect of the parameters on some of the main performance measures is illustrated by numerical examples to validate the analytical results obtained in the study. The Mathematica 10 software has been used to provide the numerical results and presentation of the effects of some performance measures through plots and graphs
On single server batch arrival queueing system with balking, three types of heterogeneous service and Bernoulli schedule server vacation
This paper investigates a batch arrival queueing system in which customers arrives at the system in a Poisson stream following a compound Poisson process and the system has a single server providing three types of general heterogeneous services. At the beginning of each service, a customer is allowed to choose any one of the three services and as soon as a service of any type gets completed, the server may take a vacation or may continue staying in the system. The vacation time is assumed to follow a general (arbitrary) distribution and the server vacation is based on Bernoulli schedule under a single vacation policy. During the server vacation period, impatient customers are assumed to balk. This paper described the model as a bivariate Markov chain and employed the supplementary variable technique to find closed-form solutions of the steady state probability generating function of number of customers, the steady state probabilities of various states of the system, the average queue size, the average system size, and the average waiting time in the queue as well as the average waiting time in the system. Further, some interesting special cases of the model are also derived. Keywords Batch Arrivals. Queueing System. Balking. Heterogeneous types of Service. Bernoulli schedule server vacation. Bivariate Markov Processes. MSC2020-Mathematics Subject Classification 34B07, 60G05, 62E1
Recommended from our members
Entropy Maximisation and Queues With or Without Balking. An investigation into the impact of generalised maximum entropy solutions on the study of queues with or without arrival balking and their applications to congestion management in communication networks.
An investigation into the impact of generalised maximum entropy solutions on the study of queues with or without arrival balking and their applications to congestion management in communication networks
Keywords: Queues, Balking, Maximum Entropy (ME) Principle, Global Balance (GB), Queue Length Distribution (QLD), Generalised Geometric (GGeo), Generalised Exponential (GE), Generalised Discrete Half Normal (GdHN), Congestion Management, Packet Dropping Policy (PDP)
Generalisations to links between discrete least biased (i.e. maximum entropy (ME)) distribution inferences and Markov chains are conjectured towards the performance modelling, analysis and prediction of general, single server queues with or without arrival balking. New ME solutions, namely the generalised discrete Half Normal (GdHN) and truncated GdHN (GdHNT) distributions are characterised, subject to appropriate mean value constraints, for inferences of stationary discrete state probability distributions. Moreover, a closed form global balance (GB) solution is derived for the queue length distribution (QLD) of the M/GE/1/K queue subject to extended Morse balking, characterised by a Poisson prospective arrival process, i.i.d. generalised exponential (GE) service times and finite capacity, K. In this context, based on comprehensive numerical experimentation, the latter GB solution is conjectured to be a special case of the GdHNT ME distribution.
ii
Owing to the appropriate operational properties of the M/GE/1/K queue subject to extended Morse balking, this queueing system is applied as an ME performance model of Internet Protocol (IP)-based communication network nodes featuring static or dynamic packet dropping congestion management schemes. A performance evaluation study in terms of the model’s delay is carried out. Subsequently, the QLD’s of the GE/GE/1/K censored queue subject to extended Morse balking under three different composite batch balking and batch blocking policies are solved via the technique of GB. Following comprehensive numerical experimentation, the latter QLD’s are also conjectured to be special cases of the GdHNT. Limitations of this work and open problems which have arisen are included after the conclusion
- …