Paper Info
Title
Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems.
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.
Year
DOI
Venue
2001
10.1287/mnsc.47.10.1421.10262
Management Science
Keywords
Field
DocType
markovian system,long-run average throughput,different service facility,near-optimal throughput,simple server assignment policy,optimal policy,finite queueing systems,assigning server,nonidling server assignment policy,service rate,tandem system,steady-state throughput,server assignment policies,steady state,markov decision process,markov decision processes
Markov process,Computer science,Queue,Server,Markov decision process,Queueing theory,Steady state,Throughput,Distributed computing
Journal
Volume
Issue
ISSN
47
10
0025-1909
Citations 
PageRank 
References 
37
2.99
10
Authors
3
Name
Order
Citations
PageRank
Sigrún Andradóttir154855.09
Hayriye Ayhan221726.52
Douglas G. Down337037.04