20.500.12556/RUL-161454 Problemi razvrščanja intervalov Interval scheduling problems Problemi razvrščanja intervalov so problemi, pri katerih imamo podane posle oziroma intervale, ki jih je potrebno procesirati ob določenem času. V večini primerov ne moremo procesirati vseh, zato se moramo odločiti, katere obdržimo in katere zavržemo. V diplomskem delu so predstavljene različice tega problema, med njimi takšne, kjer so intervali uteženi, ali pa imamo na voljo več procesorjev. Podane so tudi implementacije večine predstavljenih algoritmov v programskem jeziku Python. Izbrane algoritme tudi primerjamo glede njihovih časovnih zahtevnosti, ki so pred tem predstavljene poleg njihovih prostorskih zahtevnosti. 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. interval razvrščanje algoritem interval scheduling algorithm true false false Slovenski jezik Angleški jezik Diplomsko delo/naloga 2024-09-11 10:30:14 2024-09-11 10:30:17 2024-10-23 10:29:53 0000-00-00 00:00:00 2024 0 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 37470 212626435 Mihelak_Primoz_-_Problemi_razvrscanja_intervalov.pdf Mihelak_Primoz_-_Problemi_razvrscanja_intervalov.pdf 1 18DBFB8F54881892CCB0186132527C71 41379ad604493771652f84f9689311dcdf3e0af03337e8ce8d864ded043a48ef 056d1aef-7018-11ef-b232-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=190386 Fakulteta za računalništvo in informatiko 0 0 0