Results 301 to 310 of about 22,809,596 (368)
Some of the next articles are maybe not open access.
Randomly Timed Gated Queueing Systems
SIAM Journal on Applied Mathematics, 1998Summary: Timers are used as a control mechanism to constrain the service periods in various telecommunication networks. We introduce and analyze a general family of timer-type models, called randomly timed gated (RTG) queueing systems, which, in addition, extends and generalizes the family of M/G/1-type queues with server intermissions.
Eliazar, Iddo, Yechiali, Uri
openaire +2 more sources
Generalized Precedence-Based Queueing Systems
Mathematics of Operations Research, 1992A general K-server queueing model with precedence constraints on customer services is considered. Such a system is characterized by bulk arrivals of size K, with one customer for each server, and synchronization constraints between them and some of the previously arrived customers: Customer k (1 ≤ k ≤ K) of the nth (n ≥ 0) bulk arrival has to wait for
Liu, Zhen, Baccelli, François
openaire +2 more sources
Bayesian inference and prediction in an queueing system
, 2023S. Singh +3 more
semanticscholar +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
Queueing Systems with Service Interruptions
Operations Research, 1986In many queueing systems, the service process is subject to interruptions resulting from breakdowns, scheduled off-periods or the arrival of customers with preemptive priority. We consider a single server, first-come, first-served queueing system that alternates between periods when service is available (“on-periods”) and periods when the server is ...
Federgruen, Awi, Green, Linda
openaire +2 more sources
1982
Most service systems involve many servers, many queues, and many different types of customers, or objects which satisfy a conservation principle. These are likely to be interrelated in the sense that the operation of one component depends upon the others.
openaire +1 more source
Most service systems involve many servers, many queues, and many different types of customers, or objects which satisfy a conservation principle. These are likely to be interrelated in the sense that the operation of one component depends upon the others.
openaire +1 more source
Computers & Operations Research, 1985
We analyze an unreliable queueing system that services customers. The service facility may have one or more identical servers that are subject to random breakdowns and repairs. The infinitesimal generator of the underlying Markov process has a block tri-diagonal structure.
openaire +2 more sources
We analyze an unreliable queueing system that services customers. The service facility may have one or more identical servers that are subject to random breakdowns and repairs. The infinitesimal generator of the underlying Markov process has a block tri-diagonal structure.
openaire +2 more sources
Operations Research Letters, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kopzon, Anat, Weiss, Gideon
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kopzon, Anat, Weiss, Gideon
openaire +1 more source
1990
In this chapter we will look at the case of the single queue. Even though chapters 3 and 4 will discuss networks of queues, it is probably safe to say that the majority of modeling work that has been done for queues has involved a single queue. One reason is that for any investigation into queueing theory the single queueing system is a natural ...
openaire +1 more source
In this chapter we will look at the case of the single queue. Even though chapters 3 and 4 will discuss networks of queues, it is probably safe to say that the majority of modeling work that has been done for queues has involved a single queue. One reason is that for any investigation into queueing theory the single queueing system is a natural ...
openaire +1 more source
European Journal of Operational Research, 1991
Abstract Research on cyclical queueing systems is broken down into two categories: (1) cycling server models, and (2) cycling customer models. Within each category, details of a basic model are presented and then specialized models are discussed. This review presents a diverse sample of cyclical queueing models, with emphasis on current work and ...
openaire +1 more source
Abstract Research on cyclical queueing systems is broken down into two categories: (1) cycling server models, and (2) cycling customer models. Within each category, details of a basic model are presented and then specialized models are discussed. This review presents a diverse sample of cyclical queueing models, with emphasis on current work and ...
openaire +1 more source