Modified due-date scheduling heuristic: Difference between revisions

Revision as of 08:23, 16 October 2007

Revision as of 17:58, 16 October 2007

Line 1:

{{context}}

{{Unreferenced|date=October 2007}}

The '''modified due date''' [[heuristic]] is used in [[Scheduling (computing)|scheduling]] tasks to resources (e.g. to answer the question, "what order should we make sandwiches in, so as to please our customers?").

It assumes that the objective of the scheduling process is to minimise the total lateness of completing tasks. It is therefore only relevant when there are more tasks than the time available.

Assuming that you have a range of tasks, with a range of due dates (djd_j), and a range of times it takes to complete the tasks (pjp_j), then in each period (t) you should do the task that has the smallest modified due date (measured in time periods from now). The modified due date is the highest of either the due date, or the completion date if you started the task now ( mddj = max( dj, t+pj ) ).:

:mdd_j = max( d_j, t+p_j ).

==See also==

Line 12 ⟶ 13:

[[Category:Scheduling algorithms]]

{{compsci-stub}}