Preemptive Scheduling of Equal-Length Jobs to Minimize the weighted number of late jobs,
or 1|rj;pmtn;pj=p|Σ wj Uj

Implementation by Wojciech Jawor.

We are given n jobs. Each job has a weight, a release time before which it is not available, a strict deadline by which it has to complete, and each job has the same processing time p. We wish to find a preemptive schedule on a single machine, which minimizes the weighted number of jobs that do not meet their deadlines.


Processing time
Release times/deadlines/weights for every job
output the schedule with one job per row
(otherwise all jobs in a same row)
zoom x2