An improved balanced job bound analysis of closed queueing networks

DOI10.1016/0167-6377(87)90034-4MaRDI QIDQ578756zbMATH OpenOpenAlexFDO

Authors Yves Dallery

Publication date 1987

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

Full work available at URL https://doi.org/10.1016/0167-6377(87)90034-4

zbMATH Keywords

queueing networkperformance boundsqueueing network with single-server and infinite-server stations

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Recommendations

• Throughput bounds for closed queueing networks
• Simple bounds for closed queueing networks
• scientific article; zbMATH DE number 4079146
• Two classes of performance bounds for closed queueing networks
• New linear program performance bounds for closed queueing networks

Cites work

• scientific article; zbMATH DE number 3499038 (Why is no real title available?)
• scientific article; zbMATH DE number 3562235 (Why is no real title available?)
• scientific article; zbMATH DE number 3599479 (Why is no real title available?)
• Closed Queuing Systems with Exponential Servers
• Computational algorithms for closed queueing networks with exponential servers
• Mean-Value Analysis of Closed Multichain Queuing Networks
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Cited in

(2)

• An efficient method to determine the optimal configuration of a flexible manufacturing system
• scientific article; zbMATH DE number 3898227 (Why is no real title available?)

This page was built for publication: An improved balanced job bound analysis of closed queueing networks

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