Assembly-like queues with finite capacity: Bounds, asymptotics and approximations
type: Item
instance of: scholarly article
title: Assembly-like queues with finite capacity: Bounds, asymptotics and approximations
zbMATH Open document ID: 0649.90060
DOI: 10.1007/BF01149328
author: S. H. Smith
published in: Queueing Systems
publication date: 1986-01-01T00:00:00Z
review text: We study a queueing model of assembly-like manufacturing operations. This study was motivated by an examination of a circuit pack testing procedure in an AT \& T factory. However, the model may be representative of many manufacturing assembly operations. We assume that customers from n classes arrive according to independent Poisson processes with the same arrival rate into a single-server queueing station where the service times are exponentially distributed. The service discipline requires that service be rendered simultaneously to a group of customers consisting of exactly one member from each class. The server is idle if there are not enough customers to form a group. There is a separate waiting area for customers belonging to the same class and the size of the waiting area is the same for all classes. Customers who arrive to find the waiting area for their class full, are lost. Performance measures of interest include blocking probability, throughput, mean queue length and mean sojourn time. Since the state space for this queueing system could be large, exact answers for even reasonable values of the parameters may not be easy to obtain. We have therefore focused on two approaches. First, we find upper and lower bounds for the mean sojourn time. From these bounds we obtain the asymptotic solutions as the arrival rate (waiting room, service rate) approaches zero (infinity). Second, for moderate values of these parameters we suggest an approximate solution method. We compare the results of our approximation against simulation results and report good correspondence.
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 4060981
zbMATH Keywords: queueing model
zbMATH Keywords: assembly-like manufacturing operations
zbMATH Keywords: circuit pack testing procedure
zbMATH Keywords: assembly operations
zbMATH Keywords: Performance measures
zbMATH Keywords: blocking probability
zbMATH Keywords: throughput
zbMATH Keywords: mean queue length
zbMATH Keywords: mean sojourn time
zbMATH Keywords: upper and lower bounds
zbMATH Keywords: approximate solution
zbMATH Keywords: simulation
MaRDI profile type: Publication
cites work: Direct martingale arguments for stability: The M/G/1 case
cites work: Finite capacity assembly-like queues
cites work: Q4070096
cites work: Assembly-like queues
cites work: Q5528221
cites work: Queues with paired customers
cites work: Two Parallel Queues Created by Arrivals with Two Demands I
description: scientific article; zbMATH DE number 4060981