In this paper we will consider two-person zero-sum games and derive a general approach for solving them. We apply this approach to a queueing problem. In section 1 we will introduce the model and formulate the Key-theorem. In section 2 we develop the theory that we will use in section 3 to prove...

In this paper we apply a new framework for the study of monotonicity in queueing systems to stochastic scheduling models. This allows us a unified treatment of many different models, among which are multiple and single server models (with and without feedback), discrete and continuous time...

We give a closed-form expression for the long-run average cost and the bias vector in a two-class exponential preemptive resume priority queue with holding and switching costs. The bias vector is the sum of a quadratic function of the number of customers in each priority class and an exponential...