Abstract: Graphs are a natural tool for representing tasks to be scheduled. For example. edges might represent games between teams (represented by vertices) in a sports league, or blocks of information to be exchanged between computer processors. Then scheduling the tasks corresponds to obtaining a decomposition of the edges, usually under certain rules or guidelines. We discuss some standard scheduling/decomposition problems, and related theoretical results.