For a system of nite queues, we study how servers should be assigned dynamically to stations in order to obtain optimal (or near-optimal) long-run average throughput. We assume that travel timesâ€¦ (More)

This note discusses the relationships among three assumptions that appear frequently in the pricing/revenue management literature. These assumptions are mostly needed for analytical tractability, andâ€¦ (More)

We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival and service times areâ€¦ (More)

(Max,+) linear systems can be used to represent stochastic Petri nets belonging to the class of event graphs. This class contains various instances of queueing networks like acyclic or cyclicâ€¦ (More)

We give a Taylor series expansion for the joint Laplace transform of stationary waiting times in open (max,+)-linear stochastic systems with Poisson input. Probabilistic expressions are derived forâ€¦ (More)

For a Markovian queueing network with two stations in tandem, finite intermediate buffer, and M flexible servers, we study how the servers should be assigned dynamically to stations in order toâ€¦ (More)

We consider a nite capacity queueing system in which each arriving customer o ers a reward. A gatekeeper decides based on the reward o ered and the space remaining whether each arriving customerâ€¦ (More)

We consider the problem of determining the capacity of a planned railway infrastructure layout under uncertainties In order to address the long term nature of the problem in which the exact futureâ€¦ (More)