Optimal Dynamic Allocation of Collaborative Servers in Two Station Tandem Systems

DOI10.1109/TAC.2018.2852604zbMATH Open1482.90070arXiv1904.05571OpenAlexW2949180652WikidataQ129607187 ScholiaQ129607187MaRDI QIDQ5223668FDOQ5223668

Authors: Ioannis Papachristos, D. G. Pandelis

Publication date: 18 July 2019

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Abstract: We consider two-stage tandem queueing systems with one dedicated server in each station and a flexible server that can serve both stations. We assume exponential service times, linear holding costs accrued by jobs present in the system, and a collaborative work discipline. We seek optimal server allocation strategies for systems without external arrivals (clearing systems). When the combined rate of collaborating servers is less than the sum of their individual rates (partial collaboration), we identify conditions under which the optimal server allocation strategy is non-idling and has a threshold-type structure. Our results extend previous work on systems with additive service rates. When the aforementioned conditions are not satisfied we show by examples that the optimal policy may have counterintuitive properties, which is not the case when a fully collaborative service discipline is assumed. We also obtain novel results for any type of collaboration when idling policies may be optimal.

Full work available at URL: https://arxiv.org/abs/1904.05571

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Markov and semi-Markov decision processes (90C40)

Cited In (4)

This page was built for publication: Optimal Dynamic Allocation of Collaborative Servers in Two Station Tandem Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223668)