USING GENETIC ALGORITHMS TO UNIVERSITY TIMETABLING PROBLEM
The problem of timetabling in universities is an NP-hard problem, which involves a task scheduling activity for certain people based on multiple constraints and a limited number of resources. This paper addresses a complicated issue, that of scheduling academic classes (timetabling). The aim is to...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Editura Univeristatii "Stefan cel Mare" din Suceava
2022-06-01
|
| Series: | USV Annals of Economics and Public Administration |
| Subjects: | |
| Online Access: | http://annals.feaa.usv.ro/index.php/annals/article/view/1393/1102 |