Flexible Server Allocation and Customer Routing Policies for Two Parallel Queues When Service Rates Are Not Additive
From MaRDI portal
Publication:5301131
DOI10.1287/opre.1120.1157zbMath1267.90035OpenAlexW2086437097MaRDI QIDQ5301131
Publication date: 2 July 2013
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1120.1157
Related Items (6)
Optimal assignment of servers to tasks when collaboration is inefficient ⋮ Two‐class constrained optimization with applications to queueing control ⋮ Optimality of the fastest available server policy ⋮ Joint routing and scheduling control in a two-class network with a flexible server ⋮ Age-based Markovian approximation of the G/M/1 queue ⋮ Synchronous resource allocation: modeling, capacity, and optimization
This page was built for publication: Flexible Server Allocation and Customer Routing Policies for Two Parallel Queues When Service Rates Are Not Additive
