We study the problem of routing heterogeneous jobs to heterogeneous servers, where the service rate depends both on the job type and the server type. We employ a math programming approach which is desirable since it can easily be embedded within larger planning problems. While convex objectives...