In this talk, I will introduce genetic algorithms, and provide some computer demonstrations to show how they work on simple function optimization problems. I will then show how this technique can be applied to combinatorial optimization problems and to scheduling problems, which can be treated as constrained combinatorial optimization problems. Lastly, I will discuss what is required to take an optimization algorithm as the one described and create a successful commercial scheduling product.