Serving process with least thinking time maximizes resource utilization
Costas Courcoubetis, Pravin P. Varaiya · IEEE Transactions on Automatic Control · 1984
A fixed number of processes (users) share a common resource. Each process is described by a Markov chain with a "thinking" state and a "request" for service state. A policy is a preemptive scheme that assigns the resource to one of the simultaneously requesting processes. The policy that maximizes resource utilization assigns the resource to the process with least thinking time.