The problem of scheduling $n$ unit-time jobs with real-valued release times and deadlines is shown to be in NC. The solution is based on characterizations of a canonical schedule and best subset of jobs to be scheduled in a given time interval. The algorithm runs on a CREW PRAM in $O((\log n)^2)$ time and uses $O(n^4/ \log n)$ processors.
['Greg N. Frederickson', 'Susan H. Rodger']
An NC Algorithm for Scheduling Unit-Time Jobs with Arbitrary Release Times and Deadlines