Scheduling to Minimize Lateness

Published , Updated

The following post is derived from notes taken while reading through this textbook .

Assumptions and Statements:


Algorithm - minLateSchedule(Job[] jobs)

Input - An array of jobs to be scheduled.

Output - A list of jobs sorted in a way to minimize lateness and so that the processor is always running a job.

        Sort the jobs by their deadlines, so that the job that is due
        first is in the first position of the list and the job that is
        due last is at the end of the array.

        Then return the sorted array.