By considering a simple form of a scheduling problem, we explore the geometric combinatorics behind a host of polynomial counting functions. Along the way we will encounter Coxeter complexes, quasisymmetric functions, inside out polytopes, Hilbert series, h-vectors and other favorites of the audience