This thesis deals with scheduling problems and algorithms usable to solve them. Scheduling algorithms seek an optimal allocation of resources over time while using constraints. Scheduling problems are often different in nature and type of constraint conditions. In the practical part is solved one particular type of scheduling problem, which is a constrained version of the common scheduling problem.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:241515 |
| Date | January 2016 |
| Creators | Rybníček, Jan |
| Contributors | Mareš, Vlastimil, Dostál, Petr |
| Publisher | Vysoké učení technické v Brně. Fakulta podnikatelská |
| 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.0017 seconds