Results 131 to 140 of about 58,313 (174)
Some of the next articles are maybe not open access.
The Markovian Queue with Bounded Waiting time
Management Science, 1977The single-server queueing system is studied where arrivals are rejected if their waiting plus service times would exceed a fixed amount K. Applications of this model include equipment repair facilities and buffered communication devices with constant discharge rate receiving messages from a high-speed data channel.
Bezalel Gavish, Paul J. Schweitzer
openaire +2 more sources
Diffusion Approximations for Queues with Markovian Bases
Annals of Operations Research, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Parallel simulation of Markovian queueing networks
Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2002Consider simulating a large queueing network, i.e., one with many queues and jobs, on a parallel computer. Suppose the network is partitioned so that each processor is assigned a set of queues to simulate. The basic difficulty in parallel simulation is synchronizing the simulation clocks on each of the processors so that events appear to get executed ...
Philip Heidelberger, David M. Nicol
openaire +1 more source
Performance of multiclass Markovian queueing networks
Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187), 2002We study the distribution of steady-state queue lengths in multiclass queueing networks under a stable policy. We propose a general methodology based on Lyapunov functions, for the performance analysis of infinite state Markov chains and apply it specifically to Markovian multiclass queueing networks.
Dimitris Bertsimas +2 more
openaire +2 more sources
A heuristic for the transient expected queue length of Markovian queueing systems
Operations Research Letters, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
I-Jen Lee, Emily Roth
openaire +1 more source
2012
Queueing systems whose underlying stochastic process is a continuous-time Markov chain (CTMCs) are the simplest and most often used class of queueing systems. The analysis of these systems is based on the essential results available for the analysis of CTMCs. As a consequence, several interesting properties of these queueing systems can be described by
László Lakatos +2 more
openaire +1 more source
Queueing systems whose underlying stochastic process is a continuous-time Markov chain (CTMCs) are the simplest and most often used class of queueing systems. The analysis of these systems is based on the essential results available for the analysis of CTMCs. As a consequence, several interesting properties of these queueing systems can be described by
László Lakatos +2 more
openaire +1 more source
On Markovian Multi-Class, Multi-Server Queueing
Queueing Systems, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aart van Harten, Andrei Sleptchenko
openaire +2 more sources
On a multiserver markovian queueing system with balking and reneging
Computers & Operations Research, 1986A multi-server queueing model with balking and reneging is considered. Steady-state distribution of the number of customers in the system is obtained. An expression for the average loss of customers during a fixed duration of time is also advanced.
Aliakbar Montazer-Haghighi +2 more
openaire +3 more sources
Markovian queueing networks in a random environment
Operations Research Letters, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2020
Most continuous-time Markov chains arising in operations research receive a natural description in terms of a mapping transforming an input into an output called the state process.
openaire +1 more source
Most continuous-time Markov chains arising in operations research receive a natural description in terms of a mapping transforming an input into an output called the state process.
openaire +1 more source