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

Full description

Bibliographic Details

Published in:	Journal of physics. Conference series Vol. 1950; no. 1; pp. 12067 - 12074
Main Authors:	Kakkar, Mohit Kumar, Singla, Jajji, Garg, Neha, Gupta, Gourav, Srivastava, Prateek, Kumar, Ajay
Format:	Journal Article
Language:	English
Published:	Bristol IOP Publishing 01.08.2021
Subjects:	Curricula Evolutionary algorithms Genetic algorithms Schedules Timetables
ISSN:	1742-6588, 1742-6596
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!