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 4 of 4 for “"High school timetabling"”.

  1. A matheuristic approach for solving the high school timetabling problem

    The school timetabling is a classic optimization problem that has been extensively studied due to its practical and theoretical importance. It consists in scheduling a set of class-teacher meetings in a prefixed period of time, satisfying requirements of different types. Given the combinatorial …

    brazil-ufrgs Repository record for A matheuristic approach for solving the high school timetabling problem (opens in a new tab)

  2. New models and algorithms for the timetables of Italian high schools

    The thesis investigates new timetabling problems, which are motivated by the com- plex case of Italian schools. Generally speaking, the High School Timetabling Problem is aimed at giving the right order to the meetings between groups of students and teachers. However, it requires to pre-assign …

    cagliari Repository record for New models and algorithms for the timetables of Italian high schools (opens in a new tab)

  3. Uma abordagem metaheurística para o problema de alocação de horário escolar no IFRN

    … and personal preferences. Motivated by the high complexity for combining teacher, student, and classroom availability, as well as various other constraints, the high school timetabling problem has long been studied by the academic community. In this context, (meta)heuristic approaches have …

    brazil-ufrn Repository record for Uma abordagem metaheurística para o problema de alocação de horário escolar no IFRN (opens in a new tab)

  4. Αλγόριθμοι συνδυαστικής βελτιστοποίησης με έμφαση σε μεταευρετικές τεχνικές

    … 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 instances with sizes of practical importance. In the first three chapters optimization …

    greece Repository record for Αλγόριθμοι συνδυαστικής βελτιστοποίησης με έμφαση σε μεταευρετικές τεχνικές (opens in a new tab)