Results 261 to 270 of about 29,745 (314)
Some of the next articles are maybe not open access.
Journal of Medical Systems, 2010
Patient queues are prevalent in healthcare and wait time is one measure of access to care. We illustrate Queueing Theory-an analytical tool that has provided many insights to service providers when designing new service systems and managing existing ones.
R. Kannapiran Palvannan, Kiok Liang Teow
openaire +2 more sources
Patient queues are prevalent in healthcare and wait time is one measure of access to care. We illustrate Queueing Theory-an analytical tool that has provided many insights to service providers when designing new service systems and managing existing ones.
R. Kannapiran Palvannan, Kiok Liang Teow
openaire +2 more sources
Nonstationary analysis of the loss queue and of queueing networks of loss queues
European Journal of Operational Research, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Khalid Abdulaziz Alnowibet +1 more
openaire +1 more source
A fluid queue driven by a Markovian queue
Queueing Systems, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruno Sericola, Bruno Tuffin
openaire +1 more source
Queues where customers of one queue act as servers of the other queue
Queueing Systems, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Efrat Perel, Uri Yechiali
openaire +1 more source
Finite Queues and Cyclic Queues
Operations Research, 1960The finite queue problem, for which tables exist [Peck, L. G., R. N. Hazelwood. 1958. Finite Queuing Tables. ORSA Publications in Operations Research No. 2. Wiley, New York.], is a special case of the cyclic queue [Koenigsberg, E. 1958. Oper. Res. Quart. 9 22–35].
openaire +1 more source
To Queue or Not to Queue: A Rejoinder
Interfaces, 1979It's a good feeling to see a scholar of Peter Kolesar's stature take the time and effort to expound his views so eloquently in Interfaces. But while there is value in Professor Kolesar's comments, I feel he does not delve deeply enough. First, let me give credit to Professor Byrd [Byrd, Jack. Jr. 1978. The value of queuing theory.
openaire +1 more source
Biometrika, 1957
In dealing with problems of queueing, several writers (Kolmogoroff, 1932; Erlang*; Kendall, 1951, 1953; Lindley, 1952; Takacs, 1955) have discussed the situation where queue stability is obtained by assuming that the demand for service does not overload the service mechanism.
openaire +1 more source
In dealing with problems of queueing, several writers (Kolmogoroff, 1932; Erlang*; Kendall, 1951, 1953; Lindley, 1952; Takacs, 1955) have discussed the situation where queue stability is obtained by assuming that the demand for service does not overload the service mechanism.
openaire +1 more source
Queue Length Dependent Priority Queues
Management Science, 1971Priority rules that are mixtures of pre-emption and postponable rules are analyzed. Whether a pre-emption occurs is made to depend on some factor in addition to priority class. A lower priority customer is pre-empted if and only if the queue length of higher priority customers is N, a decision parameter.
openaire +1 more source
RAIRO - Theoretical Informatics and Applications, 2018
We introduce and study the model of diving queue automata which are basically finite automata equipped with a storage medium that is organized as a queue. Additionally, two queue heads are provided at both ends of the queue that can move in a read-only mode inside the queue. In particular, we consider suitable time constraints and the case where only a
Simon Beier +3 more
openaire +1 more source
We introduce and study the model of diving queue automata which are basically finite automata equipped with a storage medium that is organized as a queue. Additionally, two queue heads are provided at both ends of the queue that can move in a read-only mode inside the queue. In particular, we consider suitable time constraints and the case where only a
Simon Beier +3 more
openaire +1 more source
Fair queueing without per-flow queues: A Virtual Queueing Machine
2014 International Conference on Computing, Networking and Communications (ICNC), 2014In this paper, we present a novel fair-queueing solution, dubbed Virtual Queueing Machine (VQM), that avoids the one-queueing-per-flow architecture found in many existing solutions. Its objective is to provide throughput fairness among competing backlogged flows while protecting the response times for short-lived flows.
Gary Chang, C. C. Lee 0001
openaire +1 more source