Consider the problem of scheduling n jobs on a 3D printer. The turnaround time for a job is the total time from when it arrives to when it finishes printing. Suppose that all jobs arrive at the same time and that we know the time that job i will take time tᵢ to print once started on the printer. Prove that scheduling the jobs in greedy order (i.e. shortest job first) minimizes the average turnaround time.
Get Answers For Free
Most questions answered within 1 hours.