Robust optimal service analysis of single-server re-entrant queues

Abstract. We generalize the analysis of Ball, Day and Kachroo [2] to a fluid model of a single server re-entrant queue. The approach is to solve the Hamilton-Jacobi-Isaacs equation associated with optimal robust control of the system. The method of “staged ” characteristics is generalized from [2] to construct the solution explicitly. Formulas are developed allowing explicit calculations for the Skorokhod problem involved in the system equations. Such formulas are particularly important for numerical verification of conditions on the boundary of the nonnegative orthant. The optimal control (server) strategy is shown to be of linear-index type. Dai-type stability properties are discussed. A modification of the model in which new “customers ” are allowed only at a specified entry queue is considered in 2 dimensions. The same optimal strategy is found in that case as well. 1

Robust Optimal Service Analysis Of Single-Server Re-Entrant Queues

. We generalize the analysis of Ball, Day and Kachroo [2] to a fluid model of a single server re-entrant queue. The approach is to solve the Hamilton-Jacobi-Isaacs equation associated with optimal robust control of the system. The method of "staged" characteristics is generalized from [2] to construct the solution explicitly. Formulas are developed allowing explicit calculations for the Skorokhod problem involved in the system equations. Such formulas are particularly important for numerical verification of conditions on the boundary of the nonnegative orthant. The optimal control (server) strategy is shown to be of linear-index type. Dai-type stability properties are discussed. A modification of the model in which new "customers" are allowed only at a specified entry queue is considered in 2 dimensions. The same optimal strategy is found in that case as well. 1. Introduction A robustc ontrol approac h to the design of servic disc##])j# for queueing systems was initiated by Ball, Day ..