Niu’s conjecture for two-station tandem queues
Consider a stable two-station tandem queue in which the service time at station is constant and equal to . Let denote the stationary mean waiting time at station , whenever this quantity is defined. Niu's conjecture asserts that is nonincreasing in : for all , .
References
- On Niu's Conjecture for Two-Station Tandem Queues — arXiv — Hao Cao, Jian-Qiang Hu, Qixin Wang
Source: arXiv
Progress summary
An October 2026 preprint claims to prove Niu’s longstanding monotonicity conjecture for two-station tandem queues, but the proof has not been independently assessed.
Niu’s 1980 conjecture asserts that, with constant service time at station , the stationary mean waiting time at station is nonincreasing in .
October 16, 2026 claimed proof
Hao Cao, Jian-Qiang Hu, and Qixin Wang report two proofs: one for the general tandem-queue setting and one for the Poisson-arrival, exponential-service special case. The result is presented in an unrefereed preprint and remains unverified in the retrieved evidence.
Current status (as of October 2026): The conjecture is claimed proved in an October 16, 2026 preprint, but independent verification is absent.
Sources
Solutions 0
No solutions have been posted yet.