Results 171 to 180 of about 1,310 (210)
Assignment models and reneging [PDF]
Economic Theory, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Analysis of ticket queues with reneging customers
Journal of the Operational Research Society, 2015In this paper we analyse queues in which customer waiting positions are represented by ticket numbers. The customers at any time can observe the number being served and may leave the queue without obtaining the service (reneging). Assuming the customers’ tendency to renege depends dynamically on the difference between their ticket number and the number
Ding Ding, Jihong Ou, James Ang
openaire +2 more sources
A Diffusion Approximation for a Markovian Queue with Reneging
Queueing Systems, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amy R. Ward, Peter W. Glynn
openaire +2 more sources
Simultaneous access renegable priority queues
Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing, 2002A renegable priority queue has been designed on two different types of network. The first design uses hypercube networks, and has a response time and a pipeline cycle time O(log p), where p is the maximum number of processors that may access the design simultaneously.
P. R. Venkata Subramaniam, Kam-Hoi Cheng
openaire +2 more sources
Decision Sciences, 1979
ABSTRACTThis note is an extension of the approach to the problem of reneging introduced in Parkan and Warren [1]. It is assumed customers consider joining an M/M/1 queuing system with a prior gamma distribution over the values of the mean service time. Thus, each customer has an initial estimate of his total waiting time in the system.
openaire +1 more source
ABSTRACTThis note is an extension of the approach to the problem of reneging introduced in Parkan and Warren [1]. It is assumed customers consider joining an M/M/1 queuing system with a prior gamma distribution over the values of the mean service time. Thus, each customer has an initial estimate of his total waiting time in the system.
openaire +1 more source
Queuing Models with Balking, Reneging, and Interruptions
Operations Research, 1965A queuing process of the type M/G/1 is considered where units balk (refuse to join) as well as renege (depart without being serviced). The servicing of the units is subject to breakdowns caused by the arrival of “interruptions” that have to be cleared on a priority basis.
openaire +2 more sources
Performance Analysis of a Markovian Queuing System with Reneging and Retention of Reneged Customers
2016In this chapter a finite capacity single server Markovian queuing system with reneging and retention of reneged customers is considered. It is envisaged that a reneging customer may be convinced to stay for his service if some customer retention mechanism is employed. Thus, there is a probability that a reneging customer may be retained.
openaire +1 more source