Inequalities for queues with a learning server

DOI10.1023/A:1010806832532MaRDI QIDQ5938451zbMATH OpenFDO

Authors Erol A. Peköz, Michael A. Lapré

Publication date 19 July 2001

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1010806832532

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• Convex ordering of the attained waiting times in single-server queues and related problems
• scientific article; zbMATH DE number 431647
• Some comparability results for waiting times in single- and many-server queues
• scientific article; zbMATH DE number 3316606
• A Random Family of Queueing Systems with a Dynamic Priority Discipline

Cited in

(1)

• Learning unknown service rates in queues: a multiarmed bandit approach

This page was built for publication: Inequalities for queues with a learning server

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5938451)