144 research outputs found
A survey of the machine interference problem
This paper surveys the research published on the machine interference problem since the 1985 review by Stecke & Aronson. After introducing the basic model, we discuss the literature along several dimensions. We then note how research has evolved since the 1985 review, including a trend towards the modelling of stochastic (rather than deterministic) systems and the corresponding use of more advanced queuing methods for analysis. We conclude with some suggestions for areas holding particular promise for future studies.Natural Sciences and Engineering Research Council (NSERC) Discovery Grant 238294-200
Recommended from our members
A study of some M[x]/G/1 type queues with random breakdowns and bernouilli schedule server vacations based on a single vacation policy
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, human computer interaction, and so on. The classical queueing system, even vacation queues or queues subject to breakdown, might not be sufficiently realistic. The purpose of this research is to extend the work done on vacation queues and on unreliable queues by studying queueing systems which take into consideration both phenomena. We study the behavior of a batch arrival queueing system with a single server, where the system is subject to random breakdowns which require a repair process, and on the other hand, the server is allowed to take a vacation after finishing a service. The breakdowns are assumed to occur while serving a customer, and when the system breaks down, it enters a repair process immediately while the customer whose service is interrupted comes back to the head of the queue waiting for the service to resume. Server vacations are assumed to follow a Bernoulli schedule under single vacation policy. We consider the above assumptions for different queueing models: queues with generalized service time, queues with two-stages of heterogeneous service, queues with a second optional service, and queues with two types of service. For all the models mentioned above, it is assumed that the service times, vacation times, and repair times all have general arbitrary distributions. Applying the supplementary variable technique, we obtain probability generating functions of queue size at a random epoch for different states of the system, and some performance measures such as the mean queue length, mean waiting time in the queue, proportion of server's idle time, and the utilization factor. The results obtained in this research, show the effect of vacation and breakdown parameters upon main performance measures of interest. These effects are also illustrated using some numerical examples and graphs.This work is funded by the Ministry of Education, Kingdom of Bahrain
Mathematical Analysis of Queue with Phase Service: An Overview
We discuss various aspects of phase service queueing models. A large number of models have been developed in the area of queueing theory incorporating the concept of phase service. These phase service queueing models have been investigated for resolving the congestion problems of many day-to-day as well as industrial scenarios. In this survey paper, an attempt has been made to review the work done by the prominent researchers on the phase service queues and their applications in several realistic queueing situations. The methodology used by several researchers for solving various phase service queueing models has also been described. We have classified the related literature based on modeling and methodological concepts. The main objective of present paper is to provide relevant information to the system analysts, managers, and industry people who are interested in using queueing theory to model congestion problems wherein the phase type services are prevalent
Stability Condition of a Retrial Queueing System with Abandoned and Feedback Customers
This paper deals with the stability of a retrial queueing system with two orbits, abandoned and feedback customers. Two independent Poisson streams of customers arrive to the system, and flow into a single-server service system. An arriving one of type i; i = 1; 2, is handled by the server if it is free; otherwise, it is blocked and routed to a separate type-i retrial (orbit) queue that attempts to re-dispatch its jobs at its specific Poisson rate. The customer in the orbit either attempts service again after a random time or gives up receiving service and leaves the system after a random time. After the customer is served completely, the customer will decide either to join the retrial group again for another service or leave the system forever with some probability
Analysis of a batch-service queue with variable service capacity, correlated customer types and generally distributed class-dependent service times
Queueing models with batch service have been studied frequently, for instance in the domain of telecommunications or manufacturing. Although the batch server's capacity may be variable in practice, only a few authors have included variable capacity in their models. We analyse a batch server with multiple customer classes and a variable service capacity that depends on both the number of waiting customers and their classes. The service times are generally distributed and class-dependent. These features complicate the analysis in a non-trivial way. We tackle it by examining the system state at embedded points, and studying the resulting Markov Chain.
We first establish the joint probability generating function (pgf) of the service capacity and the number of customers left behind in the queue immediately after service initiation epochs. From this joint pgf, we extract the pgf for the number of customers in the queue and in the system respectively at service initiation epochs and departure epochs, and the pgf of the actual server capacity. Combined with additional techniques, we also obtain the pgf of the queue and system content at customer arrival epochs and random slot boundaries, and the pgf of the delay of a random customer. In the numerical experiments, we focus on the impact of correlation between the classes of consecutive customers, and on the influence of different service time distributions on the system performance. (C) 2019 Elsevier B.V. All rights reserved
Recommended from our members
On some queueing systems with server vacations, extended vacations, breakdowns, delayed repairs and stand-bys
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This research investigates a batch arrival queueing system with a Bernoulli scheduled vacation and random system breakdowns. It is assumed that the repair process does not start immediately after the breakdown. Consequently there maybe a delay in starting repairs. After every service completion the server may go on an optional vacation. When the original vacation is completed the server has the option to go on an extended vacation. It is assumed that the system is equipped with a stand-by server to serve the customers during the vacation period of the main server as well as during the repair process.
The service times, vacation times, repair times, delay times and extended vacation times are assumed to follow different general distributions while the breakdown times and the service times of the stand-by server follow an exponential distribution.
By introducing a supplementary variable we are able to obtain steady state results in an explicit closed form in terms of the probability generating functions. Some important performance measures including; the average length of the queue, the average number of customers in the system, the mean response time, and the value of the traffic intensity are presented.
The professional MathCad 2001 software has been used to illustrate the numerical results in this study
Resource retrial queue with two orbits and negative customers
In this paper, a multi-server retrial queue with two orbits is considered. There are two arrival processes of positive customers (with two types of customers) and one process of negative customers. Every positive customer requires some amount of resource whose total capacity is limited in the system. The service time does not depend on the customer’s resource requirement and is exponentially distributed with parameters depending on the customer’s type. If there is not enough amount of resource for the arriving customer, the customer goes to one of the two orbits, according to his type. The duration of the customer delay in the orbit is exponentially distributed. A negative customer removes all the customers that are served during his arrival and leaves the system. The objects of the study are the number of customers in each orbit and the number of customers of each type being served in the stationary regime. The method of asymptotic analysis under the long delay of the customers in the orbits is applied for the study. Numerical analysis of the obtained results is performed to show the influence of the system parameters on its performance measure
- …