The maximization of CP utilization in an exponential CP-terminal system with different think times and different job sizes (Q761939)

This paper considers the following system. Each of N terminals produces jobs for a central processor. After having produced a job the terminal sleeps until the processor has serviced it, and then the terminal starts to think about a next job. The think times of terminal i are exponentially distributed with parameter \(\lambda_ i\), and its job sizes are exponentially distributed with parameter \(\mu_ i\). All think times and job sizes are independent and not known in advance. If there is more than one job at the processor it has to be decided which job to serve. The problem considered in this paper is: which service order maximizes the processor utilization? The answer is: give priority to the jobs of the faster thinking terminals.