This paper is a compilation of my work on solving the three processor optimal scheduling problem. Throughout the semester I have written five different algorithms that solve the scheduling problem. This paper includes a deep look at the last algorithm, Branch and Bound, and compares it to all of my other algorithms.