Job Scheduling Experiment #3

Part 3: Three machines, n jobs

There are four jobs below that each require work on three machines. The operations are shown in the order in which they must be processed. Again, the number in blue is the number of hours needed for the operation; the width of the box corresponds to this time. The number in red is the due date for the job. Find the best schedule in terms of:
1. average flow time
2. average lateness

Back to Scheduling Experimental Station