Title
Partial Pooling in Tandem Lines with Cooperation and Blocking
Abstract
For a tandem line of finite, single-server queues operating under the production blocking mechanism, we study the effects of pooling several adjacent stations and the associated servers into a single station with a single team of servers. We assume that the servers are cross-trained (so that they can work at several different stations) and that two or more servers can cooperate on the same job. For such a system, we provide sufficient conditions on the service times and sizes of the input and output buffers at the pooled station under which pooling will decrease the departure time of each job from the system (and hence increase the system throughput). We also show that pooling decreases the total number of jobs in the system at any given time and the sojourn time of each job in the system if the departure time of each job from the system is decreased by pooling and there is an arrival stream at the first station. Moreover, we provide sufficient conditions under which pooling will improve the holding cost of each job in the system incurred before any given time, and extend our results to closed tandem lines and to queueing networks with either a more general blocking mechanism or probabilistic routing. Finally, we present a numerical study aimed at quantifying the improvements in system performance obtained through pooling and at understanding which stations should be pooled to achieve the maximum benefit. Our results suggest that the improvements gained by pooling may be substantial and that the bottleneck station should be among the pooled stations in order to obtain the greatest benefit.
Year
DOI
Venue
2006
10.1007/s11134-006-3101-5
Queueing Syst.
Keywords
Field
DocType
Tandem queues,Finite buffers,Cross-trained servers,Cooperating servers,Throughput,Work-in-process inventory,Holding costs,Sample-path Analysis,Stochastic orders
Production blocking,Bottleneck,Mathematical optimization,Holding cost,Pooling,Queue,Server,Real-time computing,Queueing theory,Throughput,Mathematics
Journal
Volume
Issue
ISSN
52
1
0257-0130
Citations 
PageRank 
References 
5
0.52
10
Authors
2
Name
Order
Citations
PageRank
Nilay Tanik Argon1404.22
Sigrún Andradóttir254855.09