This paper describes automated examination scheduling for the Faculty of Information Technology of Brno University of Technology. It specifies a list of restrictions that must by satisfied. Furthermore, this limitations are classified due to their influence on a quality of the final version of the examination schedule. There are two types of restrictions; soft and hard. The task is to find such a solution that satisfies all hard constraints and breaks the minimum of soft constraints using techniques described in this paper.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:234936 |
| Date | January 2015 |
| Creators | Paulík, Miroslav |
| Contributors | Burget, Radek, Kolář, Dušan |
| Publisher | Vysoké učení technické v Brně. Fakulta informačních technologií |
| 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.0016 seconds