ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Talk scheduling at the conference

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

Download (744Kb)


    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.

    Item Type: Thesis (EngD thesis)
    Keywords: generating schedule, NP-problem, backsack problem, set cover problem, greedy algorithm
    Number of Pages: 40
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    doc. dr. Andrej Brodnik5540Mentor
    doc. dr. Gregor PapaComentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536876739)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 3313
    Date Deposited: 05 Apr 2016 11:50
    Last Modified: 19 Apr 2016 13:13
    URI: http://eprints.fri.uni-lj.si/id/eprint/3313

    Actions (login required)

    View Item