Modified due-date scheduling heuristic: Difference between revisions

Revision as of 09:46, 21 October 2020

Revision as of 16:40, 24 November 2020

Line 6:

== Algorithm ==

=== Principle ===

This heuristic works the same way as other greedy algorithms. At each iteration, it finds the next job to schedule and add it to the list. This operation is repeated until no jobs are left unscheduled. MDD is similar to the [[earliest due date]] (|EDD) heuristic except that MDD takes into account the partial sequence of job that have been already constructed, whereas EDD only looks at the jobs' due dates.

=== Implementation ===