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...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | 論文 |
| 言語: | 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 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|