An approximate analysis for a class of assembly-like queues

DOI10.1007/BF01149540zbMath0651.90029OpenAlexW1985601040MaRDI QIDQ1106714

F. Bonomi

Publication date: 1987

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01149540

zbMATH Keywords

decompositionsynchronizationapproximate analytical solutionthroughputAssembly-like queuesaverage delaysclasses of customersserver utilization

Mathematics Subject Classification ID

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

Related Items (7)

Bounds and heuristics for assembly-like queues ⋮ Transient and asymptotic behavior of synchronization processes in assembly-like queues ⋮ ANALYTICAL APPROXIMATIONS FOR KITTING SYSTEMS WITH MULTIPLE INPUTS ⋮ Analysis of a fork/join station with inputs from a finite population subnetwork with multi-server stations ⋮ Estimating the throughput of an exponential CONWIP assembly system ⋮ Estimating the throughput of a cyclic assembly system ⋮ Approximations of lead-time distributions in an assemble-to-order system under a base-stock policy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Assembly-like queues with finite capacity: Bounds, asymptotics and approximations
• Finite capacity assembly-like queues
• The N/G/1 queue and its detailed analysis
• A Class of Data Traffic Processes-Covariance Function Characterization and Related Queuing Results
• Queues with paired customers
• Solution of Queuing Problems by a Recursive Technique
• Assembly-like queues

This page was built for publication: An approximate analysis for a class of assembly-like queues