← All problems

Niu’s conjecture for two-station tandem queues

Consider a stable two-station tandem queue in which the service time at station 11 is constant and equal to c>0c>0. Let W2(c)W_2(c) denote the stationary mean waiting time at station 22, whenever this quantity is defined. Niu's conjecture asserts that W2(c)W_2(c) is nonincreasing in cc: for all 0<c1≤c20<c_1\le c_2, W2(c1)≥W2(c2)W_2(c_1)\ge W_2(c_2).

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

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 cc at station 11, the stationary mean waiting time at station 22 is nonincreasing in cc.

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.