"Modelling and Solving a Scheduling Problem by Max-Flow"
, Serie RISC Institut, JKU Linz, 3-2020
Modelling and Solving a Scheduling Problem by Max-Flow
Sprache des Titels:
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.