Class Schedule Generation using Evolutionary Algorithms

Timetabling problem is known as an NP-hard problem that centres around finding an optimized allocation of subjects onto a finite available number of slots and spaces. It is perhaps the most challenging issues looked by colleges around the globe. Every academic institution faces a problem when prepar...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of physics. Conference series Jg. 1950; H. 1; S. 12067 - 12074
Hauptverfasser:	Kakkar, Mohit Kumar, Singla, Jajji, Garg, Neha, Gupta, Gourav, Srivastava, Prateek, Kumar, Ajay
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Bristol IOP Publishing 01.08.2021
Schlagworte:	Curricula Evolutionary algorithms Genetic algorithms Schedules Timetables
ISSN:	1742-6588, 1742-6596
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!