Results 261 to 270 of about 8,617 (316)
Some of the next articles are maybe not open access.
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 ...
Awi Federgruen, Linda Green
openaire +2 more sources
Operations Research Letters, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anat Kopzon, Gideon Weiss
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anat Kopzon, Gideon Weiss
openaire +1 more source
Markov-modulated queueing systems
Queueing Systems, 1989The authors give a survey of the literature published on Markov-modulated queueing systems. In such a system the primary arrival and service mechanisms are influenced by a secondary Markov process. Furthermore the authors present already established and new results together with their proofs.
N. U. Prabhu, Yixin Zhu
openaire +1 more source
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
Optimization, 1998
This paper considers an infinite server queue in discrete time in which arrivals are in batches of variable size X and service is provided in batches of fixed size R. We obtain analytical results for the number of busy servers and waiting customers at pre-arrival and arbitrary epochs.
P V. Ushakumari, A. Krishnamoorthy *
openaire +1 more source
This paper considers an infinite server queue in discrete time in which arrivals are in batches of variable size X and service is provided in batches of fixed size R. We obtain analytical results for the number of busy servers and waiting customers at pre-arrival and arbitrary epochs.
P V. Ushakumari, A. Krishnamoorthy *
openaire +1 more source
On the optimality of a maintenance queueing system
Operations Research Letters, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Su 0003, Junping Li
openaire +2 more sources
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
Queueing systems with vacations ? A survey
Queueing Systems, 1986In this excellent review article single-server queueing models with vacations are discussed. The author aims at (and succeeds in) providing a methodological overview with the objective to illustrate how the seemingly diverse mix of problems where vacation models arise in some form is closely related in structure and can be understood in a common ...
openaire +2 more sources
Queue-length distributions for multi-priority queueing systems
IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320), 1999The bottleneck in many telecommunication systems has often been modeled by an M/G/1 queueing system with priorities. While the probability generating function (PGF) for the occupancy distribution of each traffic class can be readily obtained, the occupancy distributions have been obtainable only rarely.
John N. Daigle, Matthew Roughan
openaire +1 more source
A survey of retrial queueing systems
Annals of Operations Research, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jeongsim Kim, Bara Kim
openaire +1 more source

