Talk scheduling at the conference

Emil Avdič (2016) Talk scheduling at the conference. EngD thesis.

Preview

PDF Download (744Kb)

Abstract

We will be introducing a few algorithms, that can be used for creating a schedule of a conference. Firstly we introduce greedy algorithm. We follow up with a few more complicated algorithms, that originate from the bin packing problem and the set cover problem. All three algorithms are then tested on three differently build conferences with their corresponding articles. First conference is created randomly with fictional data. Second conference is created with a pseudo random function. Third conference has real life data from a conference that is yet to come. Selected sets articles are sorted with the help of previously mentioned algorithms. Quality of algorithms is measured through a function of chromaticity and empty spaces in sessions. According to our criteria, the best algorithm is the one with the heuristics of the bin packing problem, coming from the first fit algorithm. At the end we present the results of testing.

Actions (login required)