An approximate analysis for a class of assembly-like queues
type: Item
instance of: scholarly article
title: An approximate analysis for a class of assembly-like queues
zbMATH Open document ID: 0651.90029
DOI: 10.1007/BF01149540
author: F. Bonomi
published in: Queueing Systems
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 4062797
zbMATH Keywords: synchronization
zbMATH Keywords: Assembly-like queues
zbMATH Keywords: approximate analytical solution
zbMATH Keywords: classes of customers
zbMATH Keywords: decomposition
zbMATH Keywords: server utilization
zbMATH Keywords: throughput
zbMATH Keywords: average delays
MaRDI profile type: Publication
cites work: Assembly-like queues
cites work: Queues with paired customers
cites work: Q3923308
cites work: The N/G/1 queue and its detailed analysis
cites work: Q3954626
cites work: Finite capacity assembly-like queues
cites work: Assembly-like queues with finite capacity: Bounds, asymptotics and approximations
cites work: A Class of Data Traffic Processes-Covariance Function Characterization and Related Queuing Results
cites work: Solution of Queuing Problems by a Recursive Technique
cites work: Q3326556
full work available at URL: https://doi.org/10.1007/bf01149540
OpenAlex ID: W1985601040
description: scientific article; zbMATH DE number 4062797