Results 291 to 300 of about 56,152 (322)
Some of the next articles are maybe not open access.
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
Queueing Systems with Resume Level
Ukrainian Mathematical Journal, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bratiichuk, M. S., Sliwinska, D.
openaire +2 more sources
1997
In this chapter we consider the two single server queuing systems: (i)M/E k /1 with Poisson arrivals and Erlangian service time density, and (ii)E k /M/1 with Erlangian arrivals and exponential service time density. In both systems the processes of interest are the queue length Q(t) and the waiting time W(t).
openaire +1 more source
In this chapter we consider the two single server queuing systems: (i)M/E k /1 with Poisson arrivals and Erlangian service time density, and (ii)E k /M/1 with Erlangian arrivals and exponential service time density. In both systems the processes of interest are the queue length Q(t) and the waiting time W(t).
openaire +1 more source
Mathematica Applicanda, 1982
From the introduction: "We represent network systems with a Poisson arrival stream whose parameter depends on the actual state of the system. We define a process which describes the operation of a system and present an ergodic theorem (the construction of the process and the concept of the theorem are based on a paper by I. N. Kovalenko [Izv.
openaire +1 more source
From the introduction: "We represent network systems with a Poisson arrival stream whose parameter depends on the actual state of the system. We define a process which describes the operation of a system and present an ergodic theorem (the construction of the process and the concept of the theorem are based on a paper by I. N. Kovalenko [Izv.
openaire +1 more source
Queueing Systems with Opposite Queues
2022Anastasija Glushakova, Alexander Kovshov
openaire +1 more source
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