Name
Abstract | ||
|---|---|---|
This paper considers pooling several adjacent stations in a tandem network of single-server stations with finite buffers. When stations are pooled, we assume that the tasks at those stations are pooled but the servers are not. More specifically, each server at the pooled station picks a job from the incoming buffer of the pooled station and conducts all tasks required for that job at the pooled station before that job is placed in the outgoing buffer. For such a system, we provide sufficient conditions on the buffer capacities and service times under which pooling increases the system throughput by means of sample-path comparisons. Our numerical results suggest that pooling in a tandem line generally improves the system throughput—substantially in many cases. Finally, our analytical and numerical results suggest that pooling servers in addition to tasks results in even larger throughput when service rates are additive and the two systems have the same total number of storage spaces. |
Year | DOI | Venue |
|---|---|---|
2017 | https://doi.org/10.1007/s11134-017-9543-0 | Queueing Syst. |
Keywords | Field | DocType |
Tandem queues,Finite buffers,Production blocking,Throughput,Work-in-process inventory (WIP),Sample-path analysis,Stochastic orders,90B22,60K25 | Production blocking,Tandem,Pooling,Server,Real-time computing,Queueing theory,Throughput,Mathematics,Distributed computing | Journal |
Volume | Issue | ISSN |
87 | 3-4 | 0257-0130 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nilay Tanık Argon | 1 | 76 | 6.71 |
| Sigrún Andradóttir | 2 | 548 | 55.09 |