Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems
From MaRDI portal
Publication:3114740
DOI10.1287/mnsc.47.10.1421.10262zbMath1232.90135OpenAlexW2014774334MaRDI QIDQ3114740
Douglas G. Down, Hayriye Ayhan, Sigrún Andradóttir
Publication date: 19 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.47.10.1421.10262
Related Items (37)
Sample Path Optimal Policies for Serial Lines with Flexible Workers ⋮ SERVER COORDINATION IN QUEUEING SYSTEMS: WHEN AND HOW? ⋮ Server assignment policies in queues with customer abandonments ⋮ Prioritized customer order scheduling to maximize throughput ⋮ Optimal control of queueing systems with non-collaborating servers ⋮ Multi-Actor Markov Decision Processes ⋮ Optimal assignment of servers to tasks when collaboration is inefficient ⋮ Exact tail asymptotics for a two-stage queue: Complete solution via kernel method ⋮ Flexible servers in tandem lines with setup costs ⋮ Pooling in tandem queueing networks with non-collaborative servers ⋮ Two‐class constrained optimization with applications to queueing control ⋮ MAXIMIZING THE THROUGHPUT OF TANDEM LINES WITH FLEXIBLE FAILURE-PRONE SERVERS AND FINITE BUFFERS ⋮ Dynamic control of a tandem system with abandonments ⋮ A TWO-CLASS RETRIAL SYSTEM WITH COUPLED ORBIT QUEUES ⋮ Maximizing throughput in queueing networks with limited flexibility ⋮ Dynamic server allocation for unstable queueing networks with flexible servers ⋮ Profit maximization in flexible serial queueing networks ⋮ Dynamic load balancing with flexible workers ⋮ Incentive Effects of Multiple-Server Queueing Networks: The Principal-Agent Perspective ⋮ Throughput maximization for two station tandem systems: a proof of the Andradóttir-Ayhan conjecture ⋮ Robustness of efficient server assignment policies to service time distributions in finite-buffered lines ⋮ Inventory based allocation policies for flexible servers in serial systems ⋮ 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 ⋮ DYNAMIC ASSIGNMENT OF DEDICATED AND FLEXIBLE SERVERS IN TANDEM LINES ⋮ Front-office multitasking between service encounters and back-office tasks ⋮ Asymptotically Maximal Throughput in Tandem Systems with Flexible and Dedicated Servers ⋮ Optimal pricing for tandem queues with finite buffers ⋮ OPTIMAL CONTROL OF FLEXIBLE SERVERS IN TWO TANDEM QUEUES WITH OPERATING COSTS ⋮ Staff assignment policies for a mass casualty event queuing network ⋮ Optimal control of a flexible server ⋮ Dynamic dispatching and preventive maintenance for parallel machines with dispatching-dependent deterioration ⋮ Optimal dynamic assignment of a flexible worker on an open production line with specialists ⋮ Kelly and Jackson networks with interchangeable, cooperative servers ⋮ OPTIMAL STATIC ASSIGNMENT AND ROUTING POLICIES FOR SERVICE CENTERS WITH CORRELATED TRAFFIC ⋮ Stationary analysis of certain Markov-modulated reflected random walks in the quarter plane
This page was built for publication: Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems
