Results 141 to 150 of about 17,199,333 (199)
Some of the next articles are maybe not open access.
Cooperation in Queueing Systems
SSRN Electronic Journal, 2020We study a social dilemma in a single-queue system in which human servers have discretion over the effort with which to process orders that arrive stochastically. We show theoretically that the efficient outcome in the form of high effort can be sustained in the subgame-perfect equilibrium if the interactions are long term (even when each server has a
Yaroslav Rosokha, Chen Wei
openaire +2 more sources
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
Operations Research Letters, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anat Kopzon, Gideon Weiss
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anat Kopzon, Gideon Weiss
openaire +2 more sources
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 +3 more sources
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 +3 more sources
Vaccination queueing system simulation [PDF]
Asian-European Journal of Mathematics, 2022 In order to respond to different requirements in banks, airports, hospitals and other organizations, queueing models are used to help in managing and allocating of the resources. Because we live in the pandemic of COVID-19, mass vaccination is necessary for obtaining collective immunity. For mathematical modeling of the vaccination’s process, we use a
Stojkovic, Natasa +4 more
openaire +3 more sources
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
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
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
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