Pages that link to "Item:Q2306744"

The following pages link to Algorithms for the upper bound mean waiting time in the \(\mathrm{GI}/\mathrm{GI}/1\) queue (Q2306744):

Displayed 7 items.

• Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems (Q2052432) ‎ (← links)
• Applying optimization theory to study extremal \(GI/GI/1\) transient mean waiting times (Q2167916) ‎ (← links)
• Extremal models for the \(G I \slash G I \slash K\) waiting-time tail-probability decay rate (Q2661563) ‎ (← links)
• SET-VALUED PERFORMANCE APPROXIMATIONS FOR THE QUEUE GIVEN PARTIAL INFORMATION (Q5051177) ‎ (← links)
• MAD Dispersion Measure Makes Extremal Queue Analysis Simple (Q5087732) ‎ (← links)
• A robust queueing network analyzer based on indices of dispersion (Q6053043) ‎ (← links)
• Heavy-traffic single-server queues and the transform method (Q6135886) ‎ (← links)