Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 20 for “"waiting-time distribution"”.
-
A better numerical approach for finding the steady-state waiting time and the average queue length of a system for the arithmetic GI/G/1 queue
… is developed to determine the steady-state waiting time distribution of a GI/G/1 queue by solving the discrete-time version of Lindley’s equation, when the queue is bounded on a finite interval. Then, by using Little’s Formula, we calculate the stationary distribution for the total number of …
-
Mathematical methods in queueing theory
… Pollazoek's method of finding the moments of the waiting time distribution for the queue M/G/1. They are also shown in finding Pn(t) and Pn in an example of welders using a power supply. A method of expressing the distribution of the waiting time for the queue G/G/1, due to Lindley [7], is …
-
Scheduling Policies in Service Networks
… tandem queue system: the average sojourn time and the probability of long waits. We demonstrate that a family of Threshold Based Policies (TBP) can reduce the probability of long waits while maintaining sojourn times that are only slightly higher than those of a non-idling policy. In …
-
A practical computation method for steady state solution of M/Ek/c queue
… method for steady—state information and waiting time distribution of this queueing system was developed. Validity of approximation was established directly for the large waiting times and by simulation for the smaller values. The developed method enables one to find delay probability, …
-
A modified M/G/1/N system and its application
… as a Markov Chain and the limiting probability distributions are obtained. The explicit form sorution for the queue length distribution, blocking probability, waiting time distribution as well as the busy period are derived through the Laplace-Stieltjes transform method. These results are then …
-
Grade of service of a telephone exchange.
… It can also be used for approximating the waiting time distribution for a given waiting system. (2) The equivalent trunk technique: This technique is shown to be reasonably accurate and simple for use in computing the trunk group congestion distribution when the trunk group is arranged in …
-
Simulation in the health services with an application in hospital waiting lists
… health care simulation, we simulated a hospital waiting list model, seen as a queueing process with the arrivals rate equal to the admission rate <p=1>, to show the statistical effect of using a scoring system in the policies of admission. To study the effects in the waiting time the queuening …
-
Waiting time distributions and national targets for elective surgery in UK: theoretical modelling and duration analysis
Waiting times for elective surgery constitute a key performance indicator for the NHS. The principal policy response has been to introduce maximum waiting time targets against which performance is measured and rewarded. The aim of this thesis is to shed light on the mechanism of patients’ …
-
Waiting-line problems with priority assignment, and its application on hospital emergency department wait-time
… this thesis is to first give a brief review of waiting line problems which often is a subject related to queueing theory. Simple counting processes such as the Poisson process and the duration of service time of each customer being exponentially distributed are often taught in a undergraduate or …
-
Call centres with balking and abandonment: from queueing to queueing network models
… (both exponential and general patience time distributions). In addition, we study the corresponding single-node queueing systems and obtain new results. For each model, we study the queue length distribution, waiting time distribution and the related performance measures. To facilitate …
-
Scaling, Power-Law First Return Times, and Non-Ergodicity
… multifractal analysis, and survival (or waiting-time) analysis.
-
Processos difusivos generalizados
… the diffusive term. We also considered a spatial time dependent diffusion coefficient. For these equations we have obtained a new classes of solutions and studied the connection of them with the anomalous diffusion process. We start by considering a nonlinear diffusion equation with a spatial time …
-
Stochastic analyses arising from a new approach for closed queueing networks
… method is presented to calculate the system size distribution at an arbitrary point in time and at departures for a (n)/G/1/N queue. The analysis is carried out using an embedded Markov chain approach. An algorithm is also developed that combines our analysis with the recursive method of Gupta and …
-
Three essays on long memory tests for persistence in volatility and structural vector autoregression modeling of real exchange rates
… through a Semi-Markov process with Pareto waiting times and lognormal realizations. The persistence in volatility arising from transition waiting probabilities for a Markov Regime Switching process, and from the tail index of the waiting time distribution for the Semi-Markov process is …
-
Essays on the economics of blood donations
… blood donations. The second chapter analyzes how waiting to donate blood affects donor retention. I use a panel of new blood donors, in Portugal, between 2008 and 2012. I find that higher waiting times make it less likely for first-time donors to donate again, controlling for donor and donation …
-
REAL-TIME MONITORING OF DISLOCATION AVALANCHES IN METALS: AN INTEGRATED IN SITU MICROCOMPRESSION AND ACOUSTIC EMISSION STUDY
… criticality (SOC), as evidenced by power law distributions of burst features. AE signals were found to correlate closely with observed strain bursts. Analysis of these signals, particularly their power spectral densities and waveform characteristics, allowed for identifying distinct AE …
-
Maximizing Patient Satisfaction in Systems with Time-Varying Arrival Rates
Time-Varying Little’s Law (TVLL) can be regarded as part of the theory of Infinite Servers (IS) models, for the abstract system can be considered as a general IS model if waiting time is considered as service time. Moreover, the time-varying arrival rate does not affect the waiting time …
-
Multiphoton correlations and emitters
… The noisy apparatus and their finite time resolution can modify the photon statistics. Some photons may be left undetected or misplaced (in time), additional counts may be recorded as well. We revisit the photon counting formula, that was popular in the birth of Quantum Optics, to …
-
Queueing Analysis of a Priority-based Claim Processing System
We propose a situation in which a single employee is responsible for processing incoming claims to an insurance company that can be classified as being one of two possible types. More specifically, we consider a priority-based system having separate buffers to store high priority and low priority …
-
Saddlepoint approximation to functional equations in queueing theory and insurance mathematics
… when the moment generating function (MGF) of the distribution of interest is an explicit or an implicit function of the MGF of another random variable which is assumed to be observed. In other words, let W (s) be the MGF of the random variable W of interest. We study the case when W (s) = h{G (s) …