Dynamic Server Allocation for Queueing Networks with Flexible Servers

Recommendations

Maximizing Throughput in Queueing Networks with Limited Flexibility
Maximizing throughput in queueing networks with limited flexibility
Dynamic server allocation for unstable queueing networks with flexible servers
Dynamic server assignment policies for assembly-type queues with flexible servers
Compensating for Failures with Flexible Servers

Cited in

(49)

Maximizing throughput in queueing networks with limited flexibility
Allocating flexible servers in serial systems with switching costs
Synchronous resource allocation: modeling, capacity, and optimization
Ranking flexibility structures in queueing systems
Partial pooling in tandem lines with cooperation and blocking
Scheduling servers in a two-stage queue with abandonments and costs
Optimal dynamic assignment of a flexible worker on an open production line with specialists
Interacting queues with server selection and coordinated scheduling-application to cellular data networks
Optimal and heuristic policies for dynamic server allocation
Server coordination in queueing systems: when and how?
Multiple servers and capacity sharing for implementing flexible scheduling
Dynamic server assignment policies for assembly-type queues with flexible servers
Multi-stage resource-aware scheduling for data centers with heterogeneous servers
Dynamic server allocation for unstable queueing networks with flexible servers
Allocating servers in infostations for bounded simultaneous requests
Analysis of tandem polling queues with finite buffers
Stability analysis of a two-station cascade queueing network
Asymptotically maximal throughput in tandem systems with flexible and dedicated servers
Staff assignment policies for a mass casualty event queuing network
Optimal Dynamic Server Allocation in Systems with On/Off Sources
Robustness of efficient server assignment policies to service time distributions in finite-buffered lines
scientific article; zbMATH DE number 6379042 (Why is no real title available?)
Prioritized customer order scheduling to maximize throughput
Kelly and Jackson networks with interchangeable, cooperative servers
Compensating for Failures with Flexible Servers
Maximizing Throughput in Queueing Networks with Limited Flexibility
Optimal control of queueing systems with non-collaborating servers
Profit maximization in flexible serial queueing networks
On the Optimal Allocation of Servers and Workloads in Closed Queueing Networks
Process flexibility for multiperiod production systems
Dynamic load balancing with flexible workers
DYNAMIC ASSIGNMENT OF DEDICATED AND FLEXIBLE SERVERS IN TANDEM LINES
Dynamic control of a flexible server in an assembly-type queue with setup costs
Robust scheduling for flexible processing networks
Pooling in tandem queueing networks with non-collaborative servers
Dynamic control of a tandem system with abandonments
Flexible Server Allocation and Customer Routing Policies for Two Parallel Queues When Service Rates Are Not Additive
Throughput maximization for two station tandem systems: a proof of the Andradóttir-Ayhan conjecture
Server assignment policies for maximizing the steady-state throughput of finite queueing systems
Managing flexibility: optimal sizing and scheduling of flexible servers
Flexible servers in tandem lines with setup costs
On Accommodating Customer Flexibility in Service Systems
Optimal static assignment and routing policies for service centers with correlated traffic
Dynamic scheduling for heterogeneous desktop grids
OPTIMAL CONTROL OF FLEXIBLE SERVERS IN TWO TANDEM QUEUES WITH OPERATING COSTS
Flexible queueing architectures
Modeling and analysis of flexible queueing systems
Server allocation for zero buffer tandem queues
Stability analysis of network-based cooperative resource allocation strategies

This page was built for publication: Dynamic Server Allocation for Queueing Networks with Flexible Servers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637401)