E. Hyytiä and R. Righter, Routing Jobs with Deadlines to Heterogeneous Parallel Servers, Operations Research Letters, vol. 44, no. 4, pp. 507-513, 2016.
Abstract: We consider a dispatching system, where jobs with deadlines for the waiting time are assigned to FCFS servers immediately upon arrival. The dispatching problem is to choose a server for each job so as to minimize the probability of deadline violation. We derive efficient deadline-aware policy in the MDP framework by means of policy improvement, analyze it, and evaluate its performance with simulations. We find that the new policy offers significant improvements over traditional heuristic policies.
Links:
BibTeX entry:
@article{hyytia-orl-2016,
author = {Esa Hyyti{\"a} and Rhonda Righter},
title = {Routing Jobs with Deadlines to Heterogeneous Parallel Servers},
journal = {Operations Research Letters},
volume = {44},
number = {4},
pages = {507--513},
year = {2016},
doiopt = {10.1016/j.orl.2016.05.009},
}