.png){kind=icon}
Return
TABU SEARCH FOR LARGE-SCALE TIMETABLING PROBLEMS
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(91)90321-L.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Tabu search techniques are adapted to timetabling problems. The objective is to reduce the number of conflicts due to courses taking place simultaneously but involving common students or teachers, or requiring the same classroom. In addition to these classical constraints we also take into account the grouping of students (courses taken by a large number of students have to be repeated several times during the week), compactness and precedence requirements and geographical constraints.
Keywords:
TIMETABLING
COMBINATORIAL OPTIMIZATION
TABU SEARCH
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSave
View more