Optimality of Randomized Trunk Reservation for a Problem with a Single Constraint

@inproceedings{FanOrzechowski2006OptimalityOR,
  title={Optimality of Randomized Trunk Reservation for a Problem with a Single Constraint},
  author={Xiaofei Fan-Orzechowski},
  year={2006}
}
We study an optimal admission of arriving customers to a Markovian finitecapacity queue, e.g. M/M/c/N queue, with several customer types. The system managers are paid for serving customers and penalized for rejecting them. The rewards and penalties depend on customer types. The goal is to maximize the average rewards per unit time subject to the constraint… CONTINUE READING