Indexed metadata
On Niu's Conjecture for Two-Station Tandem Queues
Hao Cao, Jian-Qiang Hu, Qixin Wang
Source abstract
In this paper, we prove a long standing conjecture in queueing theory made by Niu (1980): in a two-station tandem queueing system with constant service time (c) at station 1, the stationary average waiting time at station 2 is nonincreasing in c. Two very different proofs are provided: one for the general case and one for a special case in which the arrival process is Poisson and the service time at station 2 is exponential.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.