Open Problem—M/G/1 Scheduling with Preemption Delays

Abstract

The problem of preemptively scheduling jobs in the M/G/1 queue to minimize mean response time is a classic problem in computer systems. Typically, one assumes that the time it takes to preempt a jo...