A fast algorithm for single processor scheduling

Suppose we are given a single processor and a set S of n jobs. For each job X there is a release time rx and a deadline dx , with rx and dx nonnegative real numbers. A schedule is feasible if there is no time at which more than one job is being run and if every job in the schedule is begun no earlier than its release time and is completed by its deadline. The problem is to find a feasible schedule in which each job is run for the same amount of time p. The processing is nonpreemptive in that once a job is started it continues executing until it has run for precisely p units of time.