The following paper is a case study for scheduling of assembly processes. Two optimization methods, mixed integer programming (MIP) solver and heuristic simulation-based optimization are compared to each other. It can be shown, up to which model complexity the solver methods have the advantage over the simulation-based methods concerning a possible online application. Both, the mathematical formulation as well as the discrete event simulation (DES) system bases on a meta-model -a special Petri net. It is shown that bipartite graphs, i.e. Petri nets, avoid ambiguities in the case of alternative assembly sequences and have advantages in comparison to the usual simple precedence graphs. The results of optimization experiments are described by the example of assembling a numeric controlled (NC) milling table. The model is capable of reflecting multiple parallel assembly processes, alternative assembly steps and can predict characteristics like utilisation, stock or adherence to schedules.