MLTCS - Součastné doktorské disertace
Archiv doktorských disertací
-
-
Thesis MLTCS 2012
-
Michal Garlík
-
Model constructions for bounded arithmetic
- Supervisors :
Jan Krajíček
-
-
Defense
22/09/2015, MFF UK
-
-
-
-
-
Thesis MLTCS 2009
-
Michal Doucha
-
Forcing, deskriptivní teorie množin, analýza
- Supervisors :
Jindřich Zapletal
-
-
Defense
27/06/2013, Prague, MFF UK
-
-
-
-
-
Thesis MLTCS 2011
-
Tomáš Ebenlendr
-
Combinatorial algorithms for online problems: Semi-online scheduling on related machines
- Supervisors :
Jiří Sgall
-
-
Combinatorial algorithms for online problems: Semi-online scheduling on related machines Abstract of doctoral thesis We construct a framework that gives optimal algorithms for a whole class of scheduling problems. This class covers the most studied semi-online variants of preemptive online scheduling on uniformly related machines with the objective to minimize makespan. The algorithms from our framework are deterministic, yet they are optimal even among all randomized algorithms. In addition, they are optimal for any fixed combination of speeds of the machines, and thus our results subsume all the previous work on various special cases. We provide new lower bound of 2.112 for the original online problem. The (deterministic) upper bound is e ≈ 2.718 as there was known e-competitive randomized algorithm before. Our framework applies to all semi-online variants which are based on some knowledge about the input sequence. I.e., they are restrictions of the set of valid inputs. We use our framework to study restrictions that were studied before, and we derive some new bounds. Namely we study known sum of processing times, known maximal processing time, sorted (decreasing) jobs, tightly grouped processing times, approximately known optimal makespan and few combinations. Based on the analysis of this algorithm, we derive some global relations between various semi-online restrictions. The framework uses linear programs to compute the optimal competitive...
-
-
Defense
27/06/2011, MFF UK Praha
-
-
-
