Before revision:  The value functionapproximations induced by Taylor polynomial expansions of the cost function prove however to converge only for entire cost functions with low growth orders , and to diverge otherwise. A more suitable approach for assessing convergent interval bounds is found in the uniform approximation framework. Bernstein polynomialsconstitute straightforward, yet slowly convergent, cost function approximators over intervals. The best convergence rate in the sense of D. Jackson's theorem is achieved by more sophisticated polynomial solutions derived from trigonometric sums. This study URLanized as a guide to implementing multiple-server dispatching policies , from the specification of  cost functions towards the computation of interval bounds for the value functions and the  implementation of the policy improvement step.
After revision:  The value functionapproximations induced by Taylor polynomial expansions of the cost function prove however to converge only for entire cost functions with low growth orders , trigonometric), which achieve optimal convergence rates over finite intervals. This study addresses all the steps to implementing dispatching policies for systems of parallel servers , from the specification of cost functions towards the computation of interval bounds for the value functions and the implementation of the policy improvement step.