Abstract
We consider a single server at which customers of several classes arrive according to a stochastic point process and the server may take vacations arbitrarily. We show that under stationary conditions, the ASTA property (Arrivals See Time Averages) implies an M/G/1-like load decomposition property. A network of quasi-reversible symmetric queues with server vacations is given as an example for non-Poisson arrivals.
Original language | English |
---|---|
Pages (from-to) | 95-97 |
Number of pages | 3 |
Journal | Operations Research Letters |
Volume | 10 |
Issue number | 2 |
DOIs | |
State | Published - 1 Jan 1991 |
Externally published | Yes |
Keywords
- ASTA
- point processes
- quasi-reversibility
- queues
- stochastic decomposition
- vacation models
ASJC Scopus subject areas
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics