Pooling in tandem queueing networks with non-collaborative servers
From MaRDI portal
Publication:1688935
DOI10.1007/s11134-017-9543-0zbMath1383.90007OpenAlexW2736457789MaRDI QIDQ1688935
Nilay Tanık Argon, Sigrún Andradóttir
Publication date: 12 January 2018
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-017-9543-0
stochastic orderstandem queuesthroughputfinite bufferssample-path analysiswork-in-process inventoryproduction blocking
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal assignment of servers to tasks when collaboration is inefficient
- Stochastic orders
- Performance bounds for the effectiveness of pooling in multi-processing systems
- Structured buffer-allocation problems
- Partial pooling in tandem lines with cooperation and blocking
- On Pooling in Queueing Networks
- Convexity Results for the Erlang Delay and Loss Formulae When the Server Utilization Is Held Constant
- Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems
- Concavity of the throughput of tandem queueing systems with finite buffer storage space
- Performance of Bucket Brigades When Work Is Stochastic
- Dynamic Server Allocation for Queueing Networks with Flexible Servers
- Resource Sharing for Efficiency in Traffic Systems
- On Optimal Arrangement of Stations in a Tandem Queueing System with Blocking
- Optimal Workload Allocation in Open Networks of Multiserver Queues
- Commonalities in Reengineered Business Processes: Models and Issues
- On the Simultaneous Optimization of Server and Work Allocations in Production Line Systems with Variable Processing Times
This page was built for publication: Pooling in tandem queueing networks with non-collaborative servers