Scheduling arrivals to queues for minimum average blocking: The \(S(n)/M/C/C\) system

DOI10.1016/0305-0548(94)00068-JzbMath0845.90055OpenAlexW2052071803MaRDI QIDQ1906935

Roy D. Yates, Christopher Rose

Publication date: 12 February 1996

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)00068-j

zbMATH Keywords

blocking performancestochastic service systemaverage blockingmatrix exponential method

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)

Cites Work

• Scheduling arrivals to queues
• Scheduling arrivals to a stochastic service mechanism
• The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks
• Choosing a Good Appointment System—A Study of Queues of the Type (D, M, 1)
• Computer networks design using hybrid fuzzy expert systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling arrivals to queues for minimum average blocking: The \(S(n)/M/C/C\) system