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.90135MaRDI QIDQ3114740
Hayriye Ayhan, Sigrún Andradóttir, Douglas G. Down
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
90B22: Queues and service in operations research
Related Items
Optimal control of a flexible server, Multi-Actor Markov Decision Processes, Dynamic load balancing with flexible workers, DYNAMIC ASSIGNMENT OF DEDICATED AND FLEXIBLE SERVERS IN TANDEM LINES, OPTIMAL CONTROL OF FLEXIBLE SERVERS IN TWO TANDEM QUEUES WITH OPERATING COSTS, Dynamic server allocation for unstable queueing networks with flexible servers, Throughput maximization for two station tandem systems: a proof of the Andradóttir-Ayhan conjecture, Inventory based allocation policies for flexible servers in serial systems, 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, Sample Path Optimal Policies for Serial Lines with Flexible Workers, 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
