Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 7 of 7 for “"Examination timetabling problem"”.
-
Αλγόριθμοι συνδυαστικής βελτιστοποίησης με έμφαση σε μεταευρετικές τεχνικές
… methods for solving combinatorial optimization problems (COPs). In particular, focus is given in a special category of COPs known as timetabling problems. Timetabling problems belong in general to the class of NP-hard problems meaning that exact methods are usually unable to solve problem …
-
Modeling and Heuristic Solutions of University Timetabling Problems
This research mainly focuses on an important problem in the university timetabling problem, namely, the course timetabling problem. Most research works in this area only focus on one of the sub-problems of the course timetabling problem, such as the course scheduling problem where it is often …
-
Βελτίωση απόδοσης επιλυτών σε προβλήματα χρονοπρογραμματισμού μέσω μοντελοποίησης εξάλειψης συμμετριών
Symmetry is a pervasive and often problematic feature in combinatorial optimization problems, particularly in scheduling and timetabling. While symmetry is traditionally associated with elegance and balance in mathematics and the sciences, in optimization it frequently leads to redundant search …
-
Examination Timetabling with Mathematical Programming An Application in Turkish Air Force Academy
The focus of this thesis is the educational timetabling problem, which is a very challenging problem to solve especially with a high number of the departments, branches, classes, and students. Due to the large scale of educational timetabling problems and preferences of the stakeholders, it is …
-
A Parallel Hybrid Metaheuristic Approach for Timetabling
University timetabling is a well-known problem and much research has been done about it. This is an interesting subject to study because neither modeling nor solving it is straightforward. It has different variants ranging from teaching assignment to course timetabling to examination timetabling. …
-
Search in weighted constraint satisfaction problems
A wide variety of real-world optimisation problems can be modelled as Weighted Constraint Satisfaction Problems (WCSPs). Such problems are NP-hard and require an exponential amount of time to find the optimal solution. This thesis concentrates on the University Examination Timetabling Problem. A …
-
Παράλληλοι αλγόριθμοι και εφαρμογές σε πολυπύρηνες μονάδες επεξεργασίας γραφικών
… algorithm for solving both simple and common problems such as sorting, and computationally demanding problems, so as to fully exploit the enormous computing power of modern graphics processing units (GPUs). First problem considered is sorting, which is one of the most common problems in …