Name
Abstract | ||
|---|---|---|
We analyze a double-sided queue with priority that serves patient customers and customers with zero patience (i.e., impatient customers). In a two-sided market, high and low priority customers arrive to one side and match with queued customers on the opposite side. Impatient customers match with queued patient customers; when there is no queue, they leave the system unmatched. All arrivals follow independent Poisson processes. We derive exact formulae for the stationary queue length distribution and several steady-state performance measures. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.orl.2019.03.003 | Operations Research Letters |
Keywords | Field | DocType |
Double-sided queues,Priority service,Markov chains | Length distribution,Mathematical optimization,Queue,Poisson distribution,Mathematics | Journal |
Volume | Issue | ISSN |
47 | 3 | 0167-6377 |
Citations | PageRank | References |
1 | 0.36 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adam Diamant | 1 | 4 | 1.79 |
| Opher Baron | 2 | 145 | 14.64 |