Some Inequalities for Parallel-Server Queues

DOI10.1287/OPRE.19.2.402MaRDI QIDQ5640558zbMATH OpenOpenAlexFDO

Authors Shelby Brumelle

Publication date 1971

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.19.2.402

Mathematics Subject Classification ID

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

Cited in

(14)

• A simulation framework for networked queue models: Analysis of queue bounds in a G/G/c supply chain
• Convergence theorems for queuing and waiting-time processes with continuous time
• Approximation of multichannel queueing systems
• Convergence to limit processes in multichannel service systems
• Diffusion approximation for a tandem queue with blocking
• Heavy-traffic single-server queues and the transform method
• History of Queueing Theory in Canada Prior to 1980
• Simultaneous optimization of capacity and planned lead time in a two-stage production system with different customer due dates
• An ordering relation of the blocking two-stage tandem queueing system to the reduced single server queueing system
• Comparison of servicing strategies in multichannel queueing systems
• On Finite Moments of Full Busy Periods of GI/G/c Queues
• Queueing systems with different service disciplines
• Approximations and optimal control for state-dependent limited processor sharing queues
• Exercising control when confronted by a (Brownian) spider

This page was built for publication: Some Inequalities for Parallel-Server Queues

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