Results 191 to 200 of about 2,862 (230)
Some of the next articles are maybe not open access.
ENCOURAGED OR DISCOURSED ARRIVALS OF AN M=M=1=N QUEUEING SYSTEM WITH MODIFIED RENEGING
, 2020In this paper, we develop a finite capacity single server Markovian queueing system with encouraged or discouraged arrivals and a modified reneging policy of the customers. The Customer arrivals follow Poisson process with mean arrival rate λ and service
Hanumantha Rao, V. V. Kumar, K. S. Kumar
semanticscholar +1 more source
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 +1 more source
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
An M/M/c/N queuing system with reneging and retention of reneged customers
International Journal of Operational Research, 2013The customer impatience due to reneging results into loss of potential customers. But, if we have certain mechanism to retain such impatient customers, a significant amount of revenue can be increased. In this paper, we have developed a Markovian, finite capacity, multi-server queuing system which deals with retention of reneged customers. Accordingly,
Rakesh Kumar, Sumeet Kumar Sharma
openaire +1 more source
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 +1 more source
A fluid approximation for a matching model with general reneging distributions
Queueing systems, 2023Angelos Aveklouris +2 more
semanticscholar +1 more source
Queuing with reneging and multiple heterogeneous servers
Naval Research Logistics Quarterly, 1963AbstractA Poisson stream of items arrive at a multiple parallel serving facility consisting of s heterogeneous servers. The service time density functions are all negative exponential and may all have different means. An arrival balks (refuses to enter) if the queue size is equal to N.
Ancker, C. J. jun., Gafarian, A. V.
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
Optimal admission and queuing control with reneging behavior under premature discharge decisions
International Transactions in Operational Research, 2023Feifei Yang +3 more
semanticscholar +1 more source