Presentation on theme: "Johnson’s Rule Johnson’s rule: A procedure that minimizes makespan when scheduling a group of jobs on two workstations. Step 1. Find the shortest processing."— Presentation transcript:
1Johnson’s RuleJohnson’s rule: A procedure that minimizes makespan when scheduling a group of jobs on two workstations.Step 1. Find the shortest processing time among the jobs not yet scheduled. If two or more jobs are tied, choose one job arbitrarily.Step 2. If the shortest processing time is on workstation 1, schedule the corresponding job as early as possible. If the shortest processing time is on workstation 2, schedule the corresponding job as late as possible.Step 3. Eliminate the last job scheduled from further consideration. Repeat steps 1 and 2 until all jobs have been scheduled.
2Example 16.5 Johnson’s Rule at the Morris Machine Co. Time (hr)Motor Workstation 1 Workstation 2MM2 4 5M3 5 3MM5 10 8Eliminate M5 from consideration. The next shortest time is M1 at workstation #1, so schedule M1 next.Eliminate M3 from consideration. The next shortest time is M2 at Workstation 1, so schedule M2 first.Shortest time is 3 hours at workstation 2, so schedule job M3 last.Eliminate M1 and the only job remaining to be scheduled is M4.Eliminate M2 from consideration. The next shortest time is M5 at workstation #2, so schedule M5 next to last.Sequence =M2M1M4M5M361
3Example 16.5 Johnson’s Rule at the Morris Machine Co. The schedule minimizes the idle time of workstation 2 and gives the fastest repair time for all five motors.No other sequence will produce a lower makespan.WorkstationM2(4)M1(12)M4(15)M5(10)M3(5)Idle—availablefor further work51015202530Day35404550556065Idle2(22)(16)(8)(3)1Gantt Chart for the Morris Machine Company Repair Schedule88