Models and algorithms for high school timetabling problems
High school timetabling problems consist in assigning meetings between classes and teachers, with the goal of minimizing the violation of specific soft requisites. This category of problems has been extensively studied since the 1950s, mostly via mixed-integer programming and metaheuristic techn...
Main Author: | |
---|---|
Other Authors: | |
Language: | English |
Published: |
Universidade de São Paulo
2017
|
Subjects: | |
Online Access: | http://www.teses.usp.br/teses/disponiveis/55/55134/tde-05022018-112623/ |