Throughput Scheduling with Equal Additive Laxity.

We study a special case of the classical throughput scheduling problem. The task is to determine a largest set of jobs such that each job j can complete its processing requirement pj within its given time interval [rj,dj). In our special case, all jobs have an equal flexibility for starting, referred to as equal additive laxity dj−pj−rj=δ. We present a polynomial-time algorithm for a single machine and derive approximation algorithms in more general settings.