• @techreport{RISC6193,
    author = {Moritz Willnauer},
    title = {{Modelling and Solving a Scheduling Problem by Max-Flow}},
    language = {english},
    abstract = {This thesis shows how to specify and solve a specific scheduling problem of workgroups and loading orders. The sections on graph theory and network flows give support to understand the necessary definitions for modelling the scheduling problem as a network problem. For solving the resulting Max-Flow-Problem three different algorithms are presented. Two of them were implemented and tested with Mathematica to analyze their performance. To do this an auxiliary algorithm for finding a shortest path for the modelled network of a scheduling problem was developed. Finally, a pretty complex problem was solved by using Mathematica.},
    number = {20-12},
    year = {2020},
    month = {March},
    length = {51},
    type = {RISC Report Series},
    institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
    address = {Altenberger Stra├če 69, 4040 Linz, Austria},
    issn = {2791-4267 (online)}