In their master thesis, students demonstrate their ability to independently solve problems in the area of their specialization using state-of-the-art scientific methods.
The following list of master theses reflects a variety of different topics and projects to work on. Students are encouraged to propose further topics suiting their personal professional interest. In any case, please contact the advisor in due course.
Former Master Theses
Capacity planning for cluster tools
Available
finished
Contact
Franz Rendl
Description
Capacity planning for cluster tools - A mathematical model that reflects scheduling for parallel processing with two loadlocks.
Based on a linear model of Harrison, which solves the static allocation problem, the cluster tools are mapped as a kind of fork-network. A proof verifies that this special model of an open processing network gives a feasible schedule with minimal schedule length for an arbitrary cluster tool with three processing chambers and two loadlocks. The model is a conrete tool to answer capacity questions and therefore it plays a part in reducing the risk of bottlenecks which has a positive influence on the semiconductor manufacturing as a whole.
by Anton Ortner
Minimum Spanning Trees Using Delaunay Triangulation
Available
finished
Contact
Franz Rendl
Description
This master thesis compares various algorithms for constructing a Delaunay triangulation, a famous problem in computational geometry. Furthermore an algorithms is implemented and the running times for the minimum spanning tree using the triangulation is investigated.
