Finite State Markovian Decision Processes
Finite State Markovian Decision Processes
Class-Dependent Assignment in cluster-based servers
Proceedings of the 2004 ACM symposium on Applied computing
The LC Assignment Policy for Cluster-Based Servers
NCA '04 Proceedings of the Network Computing and Applications, Third IEEE International Symposium
Deferred Assignment Scheduling in Cluster-Based Servers
Cluster Computing
Probability in the Engineering and Informational Sciences
Hi-index | 0.00 |
In this paper we have surveyed theory related to optimization of SemiMarkov processes and we have applied these techniques to a simple dynamic ferry dispatch problem, when the customers arrive at a Ferry according to a Poisson process with rate λ 0. We have formulated this dispatch problem as a two action semi-Markov decision process and we have illustrated computationally that an optimal dispatch policy is characterized by a single critical number x0 such that it is optimal to wait until there are at least x0 customers on the ferry before a departure occurs.