Approximate techniques for general closed queueing networks with subnetworks having population constraints

DOI10.1016/0377-2217(93)90169-NzbMath0783.90037MaRDI QIDQ1310717

Yves Dallery, Bruno Baynat

Publication date: 17 March 1994

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

zbMATH Keywords

general service timesaggregation techniqueclosed queueing networkssubnetworksproduct form approximationMarie's methodpopulation constraints

Mathematics Subject Classification ID

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

Related Items (3)

An approximation for kanban controlled assembly systems ⋮ Analysis of a fork/join station with inputs from a finite population subnetwork with multi-server stations ⋮ Analysis of assembly systems controlled with kanbans

Cites Work

• Unnamed Item
• Unnamed Item
• Equivalence and decomposition in queueing systems—A unified approach
• An Approximate Analytical Method for General Queueing Networks
• Operational analysis of stochastic closed queueing networks
• A comparison of numerical techniques in Markov modeling
• Approximate Queuing Models for Multiprogramming Computer Systems
• Closed Queuing Systems with Exponential Servers

This page was built for publication: Approximate techniques for general closed queueing networks with subnetworks having population constraints