Optimal control of queueing systems with non-collaborating servers

Tuğçe Işık (), Sigrún Andradóttir and Hayriye Ayhan
Additional contact information
Tuğçe Işık: Clemson University
Sigrún Andradóttir: H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology
Hayriye Ayhan: H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology

Queueing Systems: Theory and Applications, 2016, vol. 84, issue 1, No 4, 79-110

Abstract: Abstract We study the dynamic server allocation problem for tandem queueing systems with an equal number of stations and servers. The servers are flexible, yet non-collaborative, so that at most one server can work at a station at any time. The objective is to maximize the long-run average throughput. We show that if each server is the fastest at one station, then a dedicated server assignment policy is optimal for systems of arbitrary size and with general service requirement distributions. Otherwise, the optimal policy is more complex as servers must divide their time between stations. For Markovian systems with two stations and two servers, we characterize the optimal policy completely. For larger Markovian systems, we use our results for two-station systems to propose four heuristic server assignment policies and provide computational results that show that our heuristics are near-optimal. We also compare collaborative and non-collaborative settings to evaluate the benefits of dynamic server allocation, as opposed to collaboration, in systems with flexible servers. We conclude that the loss in the long-run average throughput due to lack of collaboration is mitigated by the similarity of the tasks in the system, and cross-training can still be beneficial in non-collaborative systems.

Keywords: Tandem queueing networks; Flexible servers; Non-collaborative systems; Finite buffers; Throughput optimality; Markov decision processes; 90B22; 90C40 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s11134-016-9481-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:84:y:2016:i:1:d:10.1007_s11134-016-9481-2

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-016-9481-2

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().