On-line scheduling with hard deadlines - (Extended abstract)

We study non-preemptive, online admission control in the deadline model: each job must be either serviced prior to its deadline, or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it needs the resource, and a delay indicating the maximum time it can wait for the service to be started. The goal is to maximize total resource utilization. We obtain a series of results, under varying assumptions of job lengths and delays.