Interval scheduling problems are problems where we are given a set of jobs or intervals to process at a given time. In most cases, we are unable to process all of them, so we have to decide which we keep and which we discard. In the thesis, multiple variations of the problem are presented, in some of which the intervals have weights or there are multiple processors available. The implementations of most of the presented algorithms are also given in the Python programming language. Chosen algorithms are also compared regarding their time complexities, which were earlier presented together with their space complexities.
|
