Optimization techniques in university timetabling problem: Constraints, methodologies, benchmarks, and open issues
University timetabling problems are a yearly challenging task and are faced repeatedly each semester. The problems are considered nonpolynomial time (NP) and combinatorial optimization problems (COP), which means that they can be solved through optimization algorithms to produce the aspired optimal...
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Tech Science Press
2023
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/106432/1/FuadAbdulgaleel2023_OptimizationTechniquesinUniversityTimetablingProblem.pdf http://eprints.utm.my/106432/ http://dx.doi.org/10.32604/cmc.2023.034051 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|