We introduce Scheduling.jl, which is a toolkit for teaching the basics of scheduling theory to Computer Science students. In particular, our course focuses on scheduling algorithms for parallel, identical machines. For these types of problems, several approximation algorithms and approximation schemes exist. We believe that students better understand advantages as well as disadvantages of these approximation algorithms when they investigate their implementations and examine how the algorithms work in practice. For that purpose, we have implemented a set of heuristics and approximation algorithms on top of Scheduling.jl. In this talk, we will go through some of the implemented algorithms in Scheduling.jl and explain why we are convinced that these algorithms are particularly helpful for CS students to understand the basic concepts of approximation algorithms. In our experience, students remembered algorithmic details much better when we had shown them examples using Scheduling.jl.