Deterministic Retrial Times Are Optimal In Queues With Forbidden States

DOI10.1080/03155986.1989.11732103MaRDI QIDQ3834834zbMATH OpenOpenAlexFDO

Authors Vidyadhar G. Kulkarni, Suresh P. Sethi

Publication date 1989

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1989.11732103

zbMATH Keywords

optimal retrial timesqueueing systemregenerative states

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• On Optimal and Equilibrium Retrial Rates in a Queueing System
• Optimal threshold strategies for retrial systems with queue
• Discrete-time retrial queue with general retrial times
• Retrial queues with constant retrial times
• Approximations of retrial queue with limited number of retrials
• Optimal design for a retrial queueing system with state-dependent service rate
• scientific article; zbMATH DE number 1240547
• Finite-source retrial queues with applications
• On the retrial queue with imperfect coverage and delay reboot

Cited in

(1)

• Optimal retrial policies for restrained markov chains

This page was built for publication: Deterministic Retrial Times Are Optimal In Queues With Forbidden States

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