Optimal priority assignment: a time sharing approach

Nonstationary time-sharing policies are introduced to obtain optimal controls for new constrained optimization problems. The criteria are expected time averages of sizes of the queues. These policies and their cost are computed through linear programs. The achievable region of the vector of queues' length is characterized. Other applications of time-sharing policies are discussed.<
>