A rectification strategy in genetic algorithms for academic timetabling problem
The university course timetabling problem is both an NP-hard and NP-complete scheduling problem. The nature of the problem concerns with the assignment of lecturers-courses to available teaching space in an academic institution and may take on the form of high school timetabling, examination timetab...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penerbit UTM Press
2015
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/55860/1/TeohCheongKeat2015_ARectificationStrategyinGeneticAlgorithms.pdf http://eprints.utm.my/id/eprint/55860/ http://dx.doi.org/10.11113/jt.v74.3041 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!