Online Bin Stretching: Algorithms and Computer Lower Bounds
| Thesis title in Czech: | Online Bin Stretching: Algoritmy a strojové dolní odhady |
|---|---|
| Thesis title in English: | Online Bin Stretching: Algorithms and Computer Lower Bounds |
| Key words: | online algoritmy; aproximační algoritmy; rozvrhování |
| English key words: | online algorithms; approximation algorithms; scheduling |
| Academic year of topic announcement: | 2013/2014 |
| Thesis type: | dissertation |
| Thesis language: | angličtina |
| Department: | Computer Science Institute of Charles University (32-IUUK) |
| Supervisor: | prof. RNDr. Jiří Sgall, DrSc. |
| Author: | hidden - assigned and confirmed by the Study Dept. |
| Date of registration: | 27.09.2013 |
| Date of assignment: | 27.09.2013 |
| Confirmed by Study dept. on: | 27.01.2014 |
| Date and time of defence: | 25.09.2018 00:00 |
| Date of electronic submission: | 30.07.2018 |
| Date of submission of printed version: | 30.07.2018 |
| Date of proceeded defence: | 25.09.2018 |
| Opponents: | Christoph Durr |
| Hans Kellerer | |
| Guidelines |
| Cílem práce je navrhnout a analyzovat nové algoritmy pro rozvrhování, zejména s cílem maximalizovat počet splněných úloh. Jedním z řešených scénářů bude rozvrhování paralelních úloh. |
| References |
| D. P. Williamson, D. B. Shmoys: The Design of Approximation Algorithms, Cambridge university press, 2011.
A. Fiat, G. Woeginger: Online Algorithms - The State of the Art, LNCS 1442, Springer, 1998. M. L. Pinedo: Scheduling: Theory, Algorithms, and Systems Aktuální konferenční a časopisecké články |