Partial Pooling in Tandem Lines with Cooperation and Blocking

Authors:
Nilay Tanik Argon;Sigrún Andradóttir
Affiliations:
Department of Industrial and Systems Engineering, University of Wisconsin-Madison, Madison, USA 53706-1572;School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, USA 30332-0205
Venue:
Queueing Systems: Theory and Applications
Year:
2006

Citing 12
Cited 2

The role of work-in-process inventory in serial production lines

Operations Research
Monotonicity in generalized semi-Markov processes

Mathematics of Operations Research
Toward characterizing the optimal allocation of storage space in production line systems with variable processing times

Management Science
Optimal workload allocation in open networks of multiserver queues

Management Science
Self-buffering, self-balancing, self-flushing production lines

Management Science
Commonalities in reengineered business processes: models and issues

Management Science
Modeling and analysis of stochastic systems

Modeling and analysis of stochastic systems
On Pooling in Queueing Networks

Management Science
Performance of Bucket Brigades When Work Is Stochastic

Operations Research
Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems

Management Science
Dynamic Server Allocation for Queueing Networks with Flexible Servers

Operations Research
Throughput Maximization for Tandem Lines with Two Stations and Flexible Servers

Operations Research

TECHNICAL NOTE---Queueing Systems with Synergistic Servers

Operations Research
Optimal assignment of servers to tasks when collaboration is inefficient

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

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.