Results 141 to 150 of about 58,313 (174)
Some of the next articles are maybe not open access.
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
Optimal assignments in a markovian queueing system
Computers & Operations Research, 1981Abstract A generalization of the Hypercube queueing model for exponential queueing systems is presented which allows for distinguishable servers and multiple types of customers. Given costs associated with each server-customer pair, the determination of the assignment policy which minimizes time-averaged costs is formulated as a Markov decision ...
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 +3 more sources
A Tandem Queue with Blocking and Markovian Arrival Process
Queueing Systems, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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
Customer joining strategies in Markovian queues with B-limited service rule and multiple vacations
4or, 2023Shiyong Li
exaly
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