pub fn scheduling_edd(jobs: &[(f64, f64)]) -> Vec<usize>Expand description
Earliest due date first: the order minimising maximum lateness on one machine.
Jackson’s rule. Also by an exchange argument, and again optimal only for
its own objective: it makes no attempt to reduce the number of late jobs,
which is what moore_hodgson is for.
jobs[i] is (processing time, due date). Returns the job order.