Curriculum based course timetabling
Scheduling courses into predefined periods and rooms over a week with a given set of constraints is an NP-complete problem. This work considers proposing three-phase heuristic algorithms that fulfils the requirements of zero hard constraints values and minimal values for soft constraints. We have ru...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | conferenceObject |
| Published: |
2013
|
| Online Access: | http://hdl.handle.net/10725/7839 http://dx.doi.org/10.1109/ICNC.2013.6818082 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://ieeexplore.ieee.org/abstract/document/6818082/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|