Scheduling on uniform parallel machines
Have a set J of jobs, M uniform parallel machines.
Each job j has processing requirement pj, release date rj and due date dj. dj >= rj + pj
A machine can work on only one job at a time and each job can be processed by at most one machine at a time, but preemptions are allowed.
Scheduling problem: determine a feasible schedule that completes all jobs before their due dates or show that no such schedule exists.