In this paper, we present an analysis for an M/M/c/N queueing system with balking, reneging and synchronous vacations of partial servers together. It is assumed that arriving customers balk with a probability and renege according to an exponential distribution. The vacation policy prescribes that any d (0<d<c) servers take a vacation together when these d servers find that no customers are wait...

the paper discusses the current state of research concerning railway network timetabling and traffic management. timetable effectiveness is governed by frequency, regularity, accurate running, recovery and layover times, as well as minimal headway, buffer times and waiting times. analytic (queuing) models and stochastic microsimulation are predominantly used for estimation of waiting times and ...

The uniformly minimum variance unbiased (UMVU), maximum likelihood, percentile (PC), least squares (LS) and weighted least squares (WLS) estimators of the probability density function (pdf) and cumulative distribution function are derived for the generalized Rayleigh distribution. This model can be used quite effectively in modelling strength data and also modeling general lifetime data. It has...

We consider how to partition arriving customers into service groups that will be served separately , in a rst-come rst-served manner, by multi-server service systems having a provision for waiting, and how to assign an appropriate number of servers to each group. We assume that customers can be classiied upon arrival, possibly according to their service requirements. We model the congestion exp...

We consider an M/G/∞ exchangeable-item repair system with spares and ample servers to which arriving customers bring failed items for repair. The system comprises a multi-item-type, multiechelon system in which failed items may be either repaired at the first echelon or sent for repair in higher echelons. To decrease the average waiting time of a random customer, managers can invest in multiple...

In this paper we consider a queuing system in which the service times of customers are independent and identically distributed random variables, the arrival process is stationary and has the property of orderliness, and the queue discipline is arbitrary. For this queuing system we obtain the steady state second moment of the queue size in terms of the stationary waiting time distribution of a s...

Information about delays can enhance service quality in many industries. Delay information can take many forms, with different degrees of precision. Different levels of information have different effects on customers and so on the overall system. To explore these effects, we consider a queue with balking under three levels of delay information: no information, partial information (the system oc...

A many-server queueing system is considered in which customers arrive according to a renewal process, and have service and patience times that are drawn from two independent sequences of independent, identically distributed random variables. Customers enter service in the order of arrival and are assumed to abandon the queue if the waiting time in queue exceeds the patience time. The state Y (N...

In personalized queues, information at the level of individuals – customers or servers – is affecting system dynamics. Such information is becoming increasingly accessible, directly or statistically, as exemplified by personalized medicine (customers) or call-center workforce management (servers). In the present work, we take advantage of personalized information about customers, specifically k...

This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...