Preemptive Scheduling of Equal-Length Jobs to Minimize the weighted number of late jobs,
or 1|r_j;pmtn;p_j=p|Σ w_j U_j

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

Preemptive Scheduling of Equal-Length Jobs to Minimize the weighted number of late jobs,
or 1|r_j;pmtn;p_j=p|Σ w_j U_j

Input

Output

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

Input

Output

Preemptive Scheduling of Equal-Length Jobs to Minimize the weighted number of late jobs,
or 1|r_j;pmtn;p_j=p|Σ w_j U_j