This thesis is aimed on time frame distribution task. In the theoretical part is described the mathematical model of this task and introduced in detail two concrete heuristics: greedy look-ahead and AKRed. In the practical part of the thesis has been a real situation solved with using of sophisticated optimalization software and through own implemented heuristic. These two solution are then compared each other and applicability of each heuristics for the given real problem is evaluated.
Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:15757 |
Date | January 2009 |
Creators | Svobodová, Šárka |
Contributors | Fábry, Jan, Pelikán, Jan |
Publisher | Vysoká škola ekonomická v Praze |
Source Sets | Czech ETDs |
Language | Czech |
Detected Language | English |
Type | info:eu-repo/semantics/masterThesis |
Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0022 seconds