Results 61 to 70 of about 17,199,333 (199)
Gordon and Newell queueing networks and copulas [PDF]
In this paper we have found an analytical formula for a copula that connects the numbers Ni of customers in the nodes of a Gordon and Newell queueing network.
Ciuiu, Daniel
core
Operations Research and Decisions, 2020 This paper deals with customers' impatience behaviour for single server Markovian queueing system under K-variant working vacation policy, waiting server, Bernoulli feedback, balking, reneging, and retention of reneged customers.
Amina Angelika Bouchentouf +3 more
doaj
Bayesian control of the number of servers in a GI/M/c queuing system [PDF]
, 2004 In this paper we consider the problem of designing a GI/M/c queueing system. Given arrival and service data, our objective is to choose the optimal number of servers so as to minimize an expected cost function which depends on quantities, such as the ...
Lillo Rodríguez, Rosa Elvira +5 more
core +1 more source
Robustness in queueing systems
, 2014 We study the robustness of performance predictions of discrete- time finite-capacity queues by applying the framework of imprecise probabilities. More precisely, we consider the Geo/Geo/1/L model with probabilities of arrival and departure that are no longer fixed, but are allowed to vary within given intervals.
openaire +2 more sources
On closed queueing networks with mixed preemptive resume priority servers. [PDF]
This paper discusses a typical closed queueing network model in which multiple preemptive resume servers are present with different priority structures at each priority node. An algorithm is developed that is applicable for the three-node two-class model
Leemans, Herlinde, Dedene, Guido
core
Croatian Operational Research ReviewThis study investigates a GI/M(k)/1/N queueing system with Bernoulli feedback and multiple working vacation policy. The model incorporates customer impatience and accounts for the retention of reneged customers.
Abdelhak Guendouzi, Allal Saadaoui
doaj +1 more source
QUEUEING DISCIPLINES BASED ON PRIORITY MATRIX [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2014 The paper deals with queueing disciplines for demands of general type in queueing systems with multivendor load. A priority matrix is proposed to be used for the purpose of mathematical description of such disciplines, which represents the priority ...
Taufik I. Aliev , Eduards Maharevs
doaj
Transient bayesian inference for short and long-tailed GI/G/1 queueing systems [PDF]
, 2005 In this paper, we describe how to make Bayesian inference for the transient behaviour and busy period in a single server system with general and unknown distribution for the service and interarrival time.
Lillo Rodríguez, Rosa Elvira +5 more
core +1 more source
Queueing systems with general renovation
2009 International Conference on Ultra Modern Telecommunications & Workshops, 2009 Multi-server queueing systems with complete and general renovation are revised. Such models are often encountered in computer science applications. Methods of analysis for the queues with general(recurrent) input flow and exponential service time with different combinations of service and general renovation disciplines are discussed. Explicit solutions
openaire +4 more sources
When queueing is better than push and shove [PDF]
We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms.
Schweinzer, Paul, Gershkov, Alex
core