Summary: Robustness of Effective Server Assignment
Policies to Service Time Distributions
H. Eser Kirkizlar
School of Management
State University of New York Binghamton
Binghamton, NY 13902-6000, U.S.A.
SigrŽun AndradŽottir · Hayriye Ayhan
H. Milton Stewart School of Industrial and Systems Engineering
Georgia Institute of Technology
Atlanta, GA 30332-0205, U.S.A.
firstname.lastname@example.org, email@example.com, firstname.lastname@example.org
607-777-2106, 404-894-3933, 404-894-2308
We study the assignment of flexible servers to stations in tandem lines with service
times that are not necessarily exponentially distributed. Our goal is to achieve optimal
or near-optimal throughput. For systems with infinite buffers, it is already known that
the effective assignment of flexible servers is robust to the service time distributions.
We provide analytical results for small systems and numerical results for larger systems
that support the same conclusion for tandem lines with finite buffers. In the process,
we propose server assignment heuristics that perform well for systems with different