Scheduling Unit-Time Tasks With Integer Release Times and Deadlines

Abstract The problem of scheduling n unit-time tasks with integer release times and deadlines is shown to be solvable in o(n log n) time if a sufficient amount of uninitialized space is available. Specifically, the tasks may be scheduled in O(f(n)) time, using O(M + n) space, where f(n) is the time to solve an off-line minimum problem, and M is the size of the largest deadline. By a recent result of Gabow and Tarjan (1983), f(n) is O(n).