The Challenge of Sequencing: Optimize task schedules based on earliest due date

In job scheduling on a machine can implement different policies or rules of priority in particular seek to improve the performance of the programming in a particular indicator (minimize the amount of backlog, minimizing the average delay, minimize the maximum delay, minimize time average flow, etc.), however, the makespan or time required to complete the work will be independent identical to the priority rule.

There are many rules of priority but the most used is the rule according to the prioritization by time of delivery, or EDD.

This sequence in increasing order of their dates of upcoming delivery. Priority is given to tasks or products shorter earliest delivery or delivery.

It is used as an initial solution to sequence
minimizing the number of late tasks (Moore algorithm).


Management methods and recursive functions are used to sort and process the base matrix and the resulting vectors

The following data shows the process:

Total flow time
Average flow time
average delay
Number of backlog
Maximum delay
Average Time Delay

How to use it:

You must send as a parameter an array of N x 3,
where N is the number of processes to be sequenced,
Nx1 time column is the process (typically for machines expressed in days,
but can be a relative time unit) is Nx2 the delivery date column
which is expressed in the same unit as Nx1, in this case days.