Policy iteration techniques for multiple-server dispatching rely on the computation of value functions. In this context, we consider continuous-space M/G/1-FCFS queue endowed with an arbitrarily designed cost function waiting times incoming jobs. The associated relative is a solution Poisson’s equation Markov chains, which in work solve Laplace transform domain by considering ancillary, underly...