Blocking of finite source inputs which require simultaneous servers with general think and holding times

DOI10.1016/0167-6377(89)90033-3zbMath0678.60098OpenAlexW2041559781MaRDI QIDQ1124226

Nico M. van Dijk

Publication date: 1989

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90033-3

zbMATH Keywords

stationary distributionphase distributionblocking probabilityholding timesinsensitive resultmultiserver queueing modelproduct- form result

Mathematics Subject Classification ID

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

Related Items (5)

Computation and optimization methods for multiresource queues ⋮ Stability analysis of a multi-server model with simultaneous service and a regenerative input flow ⋮ Stability criterion of a multiserver model with simultaneous service ⋮ Open problems in queueing theory inspired by datacenter computing ⋮ Stability conditions for a multiserver queueing system with a regenerative input flow and simultaneous service of a customer by a random number of servers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A queueing system where customers require a random number of servers simultaneously
• Weak convergence for generalized semi-Markov processes
• 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
• Asymptotic expansions for closed Markovian networks with state-dependent service rates
• Some Useful Functions for Functional Limit Theorems
• Mean-Value Analysis of Closed Multichain Queuing Networks
• Continuity of Generalized Semi-Markov Processes
• 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
• Networks of queues and the method of stages
• Queuing Networks with Population Size Constraints
• Weak convergence of probability measures and random functions in the function space D[0,∞)

This page was built for publication: Blocking of finite source inputs which require simultaneous servers with general think and holding times