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...
محفوظ في:
المؤلفون الرئيسيون: | Teoh, Chong Keat, Ngadiman, Salihin, Wibowo, Antoni |
---|---|
التنسيق: | مقال |
اللغة: | English |
منشور في: |
Penerbit UTM Press
2015
|
الموضوعات: | |
الوصول للمادة أونلاين: | 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 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
A rectification strategy in genetic algorithms for academic timetabling problem
بواسطة: Teoh, Chong Keat, وآخرون
منشور في: (2015) -
Repetitive mutations in genetic algorithm for software test data generations
بواسطة: Kadhim, Mohammed Majid
منشور في: (2022) -
Communication is the source of career problems among hearing impaired group in Malaysia
بواسطة: Mohamed, Ruzaimi, وآخرون
منشور في: (2015) -
An automatic diacritization algorithm for undiacritized Arabic text
بواسطة: Zayyan, Ayman Ahmad Muhammad
منشور في: (2017) -
Minimize the makespan for job shop scheduling problem using artificial immune system approach
بواسطة: Muhamad, A. S., وآخرون
منشور في: (2015)