Results 281 to 290 of about 56,152 (322)
Some of the next articles are maybe not open access.
Queue-dependent servers queueing system
Microelectronics Reliability, 1993Abstract A Markovian queue with number of servers depending upon queue length is discussed. The system starts another server whenever the queue length in front of first server reaches a certain length N. Associating the costs with the opening of a new server and the waiting of the customers, a relationship is developed to obtain the optimum value of ...
R.L. Garg, Paramjit Singh
openaire +1 more source
Queueing System with Independent Queues and Common Server
IFAC Proceedings Volumes, 1986Abstract An approach is suggested for solving the problem of defining the length of several independent queues in the queueing system (QS) with one server. The initial QS is subjected to decomposition into two separate QS· For each of them analytical solutions are obtained, and for the second QS they are based upon embedded Markov chains. The general
E.M. Mamedli +2 more
openaire +1 more source
1987
The input (σn, τn, n ∈ Z/) is defined as in §1.1. The system has an infinite reservoir of servers, so that any customer is immediately attended. Therefore, customer n arriving at time Tn leaves at time Tn + σn (service is provided at unit rate).
François Baccelli, Pierre Brémaud
openaire +1 more source
The input (σn, τn, n ∈ Z/) is defined as in §1.1. The system has an infinite reservoir of servers, so that any customer is immediately attended. Therefore, customer n arriving at time Tn leaves at time Tn + σn (service is provided at unit rate).
François Baccelli, Pierre Brémaud
openaire +1 more source
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
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