We address the problem of scheduling a multiclass "M/M/m" queue with Bernoulli feedback on "m" parallel servers to minimize time-average linear holding costs. We analyze the performance of a heuristic priority-index rule, which extends Klimov's optimal solution to the single-server case: servers...

In this paper we address the issue of locating hierarchical facilities in the presence of congestion. Two hierarchical models are presented, where requests are attended first by lower level servers, and then some of the served customers are referred to higher level servers. In the first model,...

In mechanism design problems under incomplete information, it is generally difficult to find decision problems that are first best implementable. A decision problem under incomplete information is first best implementable if there exists a mechanism that extracts the private information and...

We consider an economy where most of the health care is publicly provided,and where there is waiting time for several types of treatments. Privatehealth care without waiting time is an option for the patients in the publichealth queue. We show that although patients with low waiting costs...

This paper deals with estimating small tail probabilities of thesteady-state waiting time in a GI/GI/1 queue withheavy-tailed (subexponential) service times. The problem ofestimating infinite horizon ruin probabilities in insurancerisk processes with heavy-tailed claims can be transformed into...