Efficient plannung of runway utilization is one of the main challenges in Air Traffic Management. We develop an optimization approach for the pre-tactical planning phase in which time windows are assigned to aircraft. Mathematically, this leads to a b-matching problem with side constraints. The optimization problem is NP-hard. We present structural insights as well as an effective exact solution algorithm. In reality, uncertainty and inaccuracy almost always lead to deviations from the actual schedule. We present some robust optimization approaches together with computational results that show their effectiveness. This is joint work with Andreas Heidt, Manu Kapolke, and Alexander Martin (all FAU).