Job Scheduling Experiment #2

Part 2: Two machines, n jobs

There are six jobs below that each require work on two machines. The operation for M1 must be performed before the operation for M2 in all cases. Again, the number in blue is the number of hours needed for the job; the width of the box corresponds to this time. The number in red is the due date for the job. Find a schedule that:
1. minimizes the makespan. (Try Johnson's Rule)
2. minimizes the average flow time
3. minimizes the average lateness

Part 3: Three machines, n jobs

Back to Scheduling Experimental Station