A queueing system where customers require a random number of servers simultaneously

DOI10.1016/0377-2217(86)90299-7zbMath0582.90035OpenAlexW1970026247MaRDI QIDQ1068692

B. George

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90299-7

zbMATH Keywords

performance measuresthroughputcommunicationsmultiple classessingle queueclosed single node queueing systemdistribution of busy serversidentical serversqueue-length distribution

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

Closed multiresource queueing systems with controllable priorities ⋮ Blocking of finite source inputs which require simultaneous servers with general think and holding times ⋮ Computation and optimization methods for multiresource queues ⋮ Stability criterion of a multiserver model with simultaneous service ⋮ The double-space parking problem

Cites Work

• Unnamed Item
• An M/G/c queue in which the number of servers required is random
• Technical Note—On Waiting Times for a Queue in Which Customers Require Simultaneous Service from a Random Number of Servers
• Queues in Which Customers Receive Simultaneous Service from a Random Number of Servers: A System Point Approach
• A Queueing System in Which Customers Require a Random Number of Servers
• Comparing Operating Characteristics of Queues in Which Customers Require a Random Number of Servers
• An embedded level crossing technique for dams and queues

This page was built for publication: A queueing system where customers require a random number of servers simultaneously