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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of physics. Conference series Ročník 1950; číslo 1; s. 12067 - 12074
Hlavní autori:	Kakkar, Mohit Kumar, Singla, Jajji, Garg, Neha, Gupta, Gourav, Srivastava, Prateek, Kumar, Ajay
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Bristol IOP Publishing 01.08.2021
Predmet:	Curricula Evolutionary algorithms Genetic algorithms Schedules Timetables
ISSN:	1742-6588, 1742-6596
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!