Dynamic Server Allocation for Queueing Networks with Flexible Servers

From MaRDI portal
Publication:3637401

DOI10.1287/opre.51.6.952.24913zbMath1165.90384OpenAlexW2128586119MaRDI QIDQ3637401

Hayriye Ayhan, Douglas G. Down, Sigrún Andradóttir

Publication date: 9 July 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.51.6.952.24913




Related Items

SERVER COORDINATION IN QUEUEING SYSTEMS: WHEN AND HOW?Prioritized customer order scheduling to maximize throughputOptimal control of queueing systems with non-collaborating serversFlexible servers in tandem lines with setup costsDynamic control of a flexible server in an assembly-type queue with setup costsPooling in tandem queueing networks with non-collaborative serversDynamic control of a tandem system with abandonmentsMaximizing throughput in queueing networks with limited flexibilityOn Accommodating Customer Flexibility in Service SystemsStability analysis of a two-station cascade queueing networkDynamic server allocation for unstable queueing networks with flexible serversAnalysis of tandem polling queues with finite buffersProcess Flexibility for Multiperiod Production SystemsProfit maximization in flexible serial queueing networksDynamic load balancing with flexible workersDynamic scheduling for heterogeneous desktop gridsMulti-stage resource-aware scheduling for data centers with heterogeneous serversThroughput maximization for two station tandem systems: a proof of the Andradóttir-Ayhan conjectureRobustness of efficient server assignment policies to service time distributions in finite-buffered linesStability analysis of network-based cooperative resource allocation strategiesPartial pooling in tandem lines with cooperation and blockingDYNAMIC ASSIGNMENT OF DEDICATED AND FLEXIBLE SERVERS IN TANDEM LINESAsymptotically Maximal Throughput in Tandem Systems with Flexible and Dedicated ServersOPTIMAL CONTROL OF FLEXIBLE SERVERS IN TWO TANDEM QUEUES WITH OPERATING COSTSStaff assignment policies for a mass casualty event queuing networkRobust scheduling for flexible processing networksRanking flexibility structures in queueing systemsOptimal dynamic assignment of a flexible worker on an open production line with specialistsSynchronous resource allocation: modeling, capacity, and optimizationKelly and Jackson networks with interchangeable, cooperative serversOPTIMAL STATIC ASSIGNMENT AND ROUTING POLICIES FOR SERVICE CENTERS WITH CORRELATED TRAFFICServer allocation for zero buffer tandem queues