Server assignment policies for maximizing the steady-state throughput of finite queueing systems
From MaRDI portal
Recommendations
- Dynamic server assignment policies for assembly-type queues with flexible servers
- Throughput Maximization for Tandem Lines with Two Stations and Flexible Servers
- Optimal control of queueing systems with non-collaborating servers
- Maximizing throughput in finite-source parallel queue systems
- Dynamic Server Allocation for Queueing Networks with Flexible Servers
Cited in
(56)- Optimal server resource reservation policies for priority classes of users under cyclic non-homogeneous Markov modeling
- Assigning a single server to inhomogeneous queues with switching costs
- Pooling in tandem queueing networks with non-collaborative servers
- Dynamic control of a tandem system with abandonments
- Front-office multitasking between service encounters and back-office tasks
- Stationary analysis of certain Markov-modulated reflected random walks in the quarter plane
- Server assignment policies in queues with customer abandonments
- Inventory based allocation policies for flexible servers in serial systems
- Virtual allocation policies for many-server queues with abandonment
- Optimal pricing for tandem queues with finite buffers
- Staff assignment policies for a mass casualty event queuing network
- Dynamic dispatching and preventive maintenance for parallel machines with dispatching-dependent deterioration
- Minimizing equilibrium expected sojourn time via performance-based mixed threshold demand allocation in a multiple-server queueing environment
- Optimal control of a single server in a finite-population queueing network
- Maximizing throughput in queueing networks with limited flexibility
- A tandem queue with coupled processors: Computational issues
- On the introduction of an agile, temporary workforce into a tandem queueing system
- Partial pooling in tandem lines with cooperation and blocking
- Optimal dynamic assignment of a flexible worker on an open production line with specialists
- Optimal static assignment and routing policies for service centers with correlated traffic
- Sample path optimal policies for serial lines with flexible workers
- Optimizing data throughput in client/server systems by keeping queue sizes balanced
- Dynamic server assignment policies for assembly-type queues with flexible servers
- Throughput maximization in a loss queueing system with heterogeneous servers
- Prioritized customer order scheduling to maximize throughput
- Optimal control of queueing systems with non-collaborating servers
- MAXIMIZING THE THROUGHPUT OF TANDEM LINES WITH FLEXIBLE FAILURE-PRONE SERVERS AND FINITE BUFFERS
- Robustness of efficient server assignment policies to service time distributions in finite-buffered lines
- Optimal assignment of servers to tasks when collaboration is inefficient
- Scheduling service in tandem queues attended by a single server
- Optimal service assignment in a finite-source queue
- Flexible servers in tandem lines with setup costs
- Dynamic server allocation for unstable queueing networks with flexible servers
- Maximizing throughput in finite-source parallel queue systems
- Optimal control of a flexible server
- Exact tail asymptotics for a two-stage queue: complete solution
- Asymptotically maximal throughput in tandem systems with flexible and dedicated servers
- Profit maximization in flexible serial queueing networks
- Optimal intensity allocation of single-server queueing networks
- Kelly and Jackson networks with interchangeable, cooperative servers
- Server coordination in queueing systems: when and how?
- Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates
- Multi-Actor Markov Decision Processes
- A two-class retrial system with coupled orbit queues
- Dynamic load balancing with flexible workers
- Incentive effects of multiple-server queueing networks: the principal-agent perspective
- DYNAMIC ASSIGNMENT OF DEDICATED AND FLEXIBLE SERVERS IN TANDEM LINES
- Throughput maximization for two station tandem systems: a proof of the Andradóttir-Ayhan conjecture
- OPTIMAL CONTROL OF FLEXIBLE SERVERS IN TWO TANDEM QUEUES WITH OPERATING COSTS
- Optimal Server Allocation to Parallel Queues with Finite-Capacity Buffers
- On the Optimal Allocation of Servers and Workloads in Closed Queueing Networks
- Two‐class constrained optimization with applications to queueing control
- Optimal Server Assignment in Queues with Flexible Servers and Abandonments
- Task assignment in multiple server farms using preemptive migration and flow control
- Optimal pricing and information sharing strategies in a single-server queue
- Scheduling servers in a two-stage queue with abandonments and costs
This page was built for publication: Server assignment policies for maximizing the steady-state throughput of finite queueing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3114740)
