An optimal service policy from this policy space
is...
- Non-idling
- Piecewise-constant: the server only changes the request in service upon
an arrival to or departure from the system
- Non-processor-sharing
- Markov: makes its service decisions independent of past behavior and
future arrivals
- Greedy: chooses to serve the request with the current maximum potential revenue
Thus, for this policy space, the optimal policy is last-in, first-out,
preemptive-resume (LIFO-PR)