This document summarizes a research paper that investigates minimizing the makespan of a job shop production system at Dejena Aviation Industry using a shifting bottleneck heuristic algorithm. The paper analyzes production data from 5 machines and 5 jobs. It finds that applying the shifting bottleneck algorithm reduces the total makespan by 8.33%. Machine 1 and 3 are the least utilized at 41% and 36% respectively, while machine 3 and 5 are the busiest at 64% and 59%. The algorithm iteratively identifies bottleneck machines and reschedules jobs to minimize the maximum lateness time and reduce the makespan.