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

Authors:
Sigrún Andradóttir;Hayriye Ayhan;Douglas G. Down
Affiliations:
-;-;-
Venue:
Management Science
Year:
2001

Citing 0
Cited 16

OPTIMAL CONTROL OF A TWO-STAGE TANDEM QUEUING SYSTEM WITH FLEXIBLE SERVERS

Probability in the Engineering and Informational Sciences
A Tandem Queue with Coupled Processors: Computational Issues

Queueing Systems: Theory and Applications
On the Introduction of an Agile, Temporary Workforce into a Tandem Queueing System

Queueing Systems: Theory and Applications
Partial Pooling in Tandem Lines with Cooperation and Blocking

Queueing Systems: Theory and Applications
A dispatching rule for photolithography scheduling with an on-line rework strategy

Computers and Industrial Engineering
Optimal control of flexible servers in two tandem queues with operating costs

Probability in the Engineering and Informational Sciences
Maximizing the throughput of tandem lines with flexible failure-prone servers and finite buffers

Probability in the Engineering and Informational Sciences
Throughput maximization for two station tandem systems: a proof of the Andradóttir---Ayhan conjecture

Queueing Systems: Theory and Applications
TECHNICAL NOTE---Queueing Systems with Synergistic Servers

Operations Research
Dynamic server allocation for unstable queueing networks with flexible servers

Queueing Systems: Theory and Applications
Flexible servers in tandem lines with setup costs

Queueing Systems: Theory and Applications
Maximizing throughput in queueing networks with limited flexibility

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
A Queueing Model to Evaluate the Impact of Patient “Batching” on Throughput and Flow Time in a Medical Teaching Facility

Manufacturing & Service Operations Management
A Little Flexibility Is All You Need: On the Asymptotic Value of Flexible Capacity in Parallel Queuing Systems

Operations Research
A Little Flexibility Is All You Need: On the Asymptotic Value of Flexible Capacity in Parallel Queuing Systems

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

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

For a system of finite queues, we study how servers should be assigned dynamically to stations in order to obtain optimal (or near-optimal) long-run average throughput. We assume that travel times between different service facilities are negligible, that each server can work on only one job at a time, and that several servers can work together on one job. We show that when the service rates depend only on either the server or the station (and not both), then all nonidling server assignment policies are optimal. Moreover, for a Markovian system with two stations in tandem and two servers, we show that the optimal policy assigns one server to each station unless that station is blocked or starved (in which case the server helps at the other station), and we specify the criterion used for assigning servers to stations. Finally, we propose a simple server assignment policy for tandem systems in which the number of stations equals the number of servers, and we present numerical results that show that our policy appears to yield near-optimal throughput under general conditions.