Waiting time in a combined first-come-first-served and shortest-time-first queue.
From MaRDI portal
Publication:1422365
DOI10.1016/S0305-0548(02)00106-5zbMath1039.90009MaRDI QIDQ1422365
Minqing Gong, Tan-Yu Lee, Pu Patrick Wang
Publication date: 14 February 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Order statisticsPriority queueProbability generating functionQueueing controlSteady-state probability
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Transient probabilities of a single server priority queueing system
- Relations, bounds and approximations for order statistics
- Priority queues
- Performance comparison of some discrete service time systems
- Robustness of Rootfinding in Single-Server Queueing Models
This page was built for publication: Waiting time in a combined first-come-first-served and shortest-time-first queue.