In this companion paper of [10] we introduce the combinatorial notion of unbalance for a
routing pattern. Using this unbalance we derive an upper bound for the total average …

We consider queueing systems in which arriving customers (jobs) are routed at the moment
of their arrival to N≥ 2 parallel servers, each having its own queue with infinite buffer size …

In this article, we consider deterministic (both fluid and discrete) polling systems with N
queues with infinite buffers and we show how to compute the best polling sequence …

In this paper, we study the control problem of optimal assignment of tasks to servers in a
multi-server queue with inhomogeneous servers. In order to improve the performance of the …

Quasi-open-loop policies consist of sequences of Markovian decision rules that are
insensitive to one component of the state space. Given a semi-Markov decision process …

NOTE ON THE CONVEXITY OF THE STATIONARY WAITING TIME AS A FUNCTION OF THE
DENSITY Page 1 NOTE ON THE CONVEXITY OF THE STATIONARY WAITING TIME AS A …

Release management is the process by which a firm decides how to construct, sequence,
and time new releases of its products. Given that it takes time to develop new functionality …

In this article we study Markov decision process (MDP) problems with the restriction that at
decision epochs, only a finite number of given Markov decision rules are admissible. For …

The problem of routing deterministic arriving jobs to parallel servers with deterministic
service times, when the job arrival rate equals the total service capacity, requires finding a …

In this paper, we consider deterministic (both fluid and discrete) polling systems with N
queues with infinite buffers and we show how to compute the best polling sequence …