This master thesis investigates a yet undocumented topic. In detail, the paper deals with a combined multi machine scheduling- and a sequencing problem. The task is, to allocate efficiently several jobs to a defined number of identical production lines, which are composed of different machines. Additionally, the jobs should be arranged within the lines in an order, which reduces the time used to execute all tasks. Various algorithms have been developed, adapted and implemented to solve the specified problem. The methods are combined to build and improve the production plan incrementally. The goal is, to minimize the highest total completion time of all production lines. The process steps are: First the jobs are assigned to the available production lines based on certain priority rules. The generated production plan is optimized and the job sequence is improved. Last but not least capacity gaps are closed through a correction procedure. The evaluation gives an advice about the most stable and reliable algorithms, which are able to find good solutions under certain runtime restrictions.