Results 191 to 200 of about 1,352 (222)
Some of the next articles are maybe not open access.
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 +2 more sources
1987
Networks of queues with priorities among job classes arise frequently as models for a wide variety of congestion phenomena. Simulation is usually the only available means for studying such networks. The underlying stochastic process of the simulation is defined in terms of a linear “job stack,” an enumeration by service center and job class of all the ...
openaire +1 more source
Networks of queues with priorities among job classes arise frequently as models for a wide variety of congestion phenomena. Simulation is usually the only available means for studying such networks. The underlying stochastic process of the simulation is defined in terms of a linear “job stack,” an enumeration by service center and job class of all the ...
openaire +1 more source
Markovian queueing models with periodic-review
Computers & Operations Research, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 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
1997
We begin our study of queueing systems by considering some simple models in which customers arrive in a Poisson process at a rate λ(0 < λ < ∞) and are served by s customers (1 ≤ s < ∞) in parallel on a first come, first served basis, the service times of customers having the exponential density μe -μx (0 < x < ∞).
openaire +1 more source
We begin our study of queueing systems by considering some simple models in which customers arrive in a Poisson process at a rate λ(0 < λ < ∞) and are served by s customers (1 ≤ s < ∞) in parallel on a first come, first served basis, the service times of customers having the exponential density μe -μx (0 < x < ∞).
openaire +1 more source
Queues with semi-Markovian arrivals
Journal of Applied Probability, 1967A queueing system with a single server is considered. There are a finite number of types of customers, and the types of successive arrivals form a Markov chain. Further, the nth interarrival time has a distribution function which may depend on the types of the nth and the n–1th arrivals.
openaire +2 more sources
Simple Markovian Queueing Systems
2008Poisson arrivals and exponential service make queueing models Markovian that are easy to analyze and get useable results. Historically, these are also the models used in the early stages of queueing theory to help decision-making in the telephone industry.
openaire +1 more source
Non-Markovian Networks of Queues
1987In Chapter 3 we developed regenerative simulation methods for networks of queues with exponential service times and Markovian job routing. In this chapter, we derive analogous estimation procedures for networks with general service times. The development requires that we restrict attention to networks that have a “single state” in which all jobs are at
openaire +1 more source