Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1287/opre.1040.0200 | Operations Research |
Keywords | Field | DocType |
heuristic server-assignment policy,optimal long-run average throughput,tandem lines,single job,near-optimal long-run average throughput,flexible servers,markovian queueing network,throughput maximization,server capability,finite intermediate buffer,andm flexible server,optimal policy,extensive numerical evidence | Dynamic programming,Heuristic,Markov process,Scheduling (computing),Computer science,Server,Queueing theory,Flexible manufacturing system,Throughput,Operations management | Journal |
Volume | Issue | ISSN |
53 | 3 | 0030-364X |
Citations | PageRank | References |
23 | 1.29 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sigrún Andradóttir | 1 | 548 | 55.09 |
| Hayriye Ayhan | 2 | 217 | 26.52 |