Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions (Q2668751)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions |
scientific article; zbMATH DE number 7485336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions |
scientific article; zbMATH DE number 7485336 |
Statements
Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions (English)
0 references
7 March 2022
0 references
course timetabling
0 references
perturbation
0 references
simulated annealing
0 references
integer programming
0 references
robustness
0 references
0 references
0 references
0 references
0 references
0.8633006811141968
0 references
0.8629089593887329
0 references
0.8308928608894348
0 references
0.7839064002037048
0 references
0.7612388730049133
0 references
