Abstract
We introduce a simple approach for the analysis of the M/M/c queues with a single class of customers and constant impatience time by finding simple Markov processes (see (2.1) and (2.15) below), and then by applying this approach we analyze the M/M/1 queues with two classes of customers in which class 1 customers have impatience of constant duration, and class 2 customers have no impatience and lower priority than class 1 customers.
Original language | English |
---|---|
Pages (from-to) | 49-66 |
Number of pages | 18 |
Journal | Queueing Systems |
Volume | 38 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2001 May |
Bibliographical note
Funding Information:∗This work was supported by grant No. 98-0101-02-01-3 from the Basic Research Program of the Korea Science & Engineering Foundation.
Keywords
- Impatient customer
- M/M/1 queue
- Markov process
- Preemptive priority
- System size
- Total response time
- Waiting time
ASJC Scopus subject areas
- Statistics and Probability
- Computer Science Applications
- Management Science and Operations Research
- Computational Theory and Mathematics