Throughput Maximization for Tandem Lines with Two Stations and Flexible Servers

Authors:
Sigrún Andradóttir;Hayriye Ayhan
Affiliations:
-;-
Venue:
Operations Research
Year:
2005

Citing 0
Cited 9

Partial Pooling in Tandem Lines with Cooperation and Blocking

Queueing Systems: Theory and Applications
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
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
Optimal assignment of servers to tasks when collaboration is inefficient

Queueing Systems: Theory and Applications
Cost sharing of cooperating queues in a Jackson network

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a Markovian queueing network with two stations in tandem, finite intermediate buffer, andM flexible servers, we study how the servers should be assigned dynamically to stations to obtain optimal long-run average throughput. We assume that each server can work on only one job at a time, that several servers can work together on a single job, and that the travel times between stations are negligible. Under these assumptions, we completely characterize the optimal policy for systems with three servers. We also provide a conjecture for the structure of the optimal policy for systems with four or more servers that is supported by extensive numerical evidence. Finally, we develop heuristic server-assignment policies for systems with three or more servers that are easy to implement, robust with respect to the server capabilities, and generally appear to yield near-optimal long-run average throughput.