University Scheduling using Genetic Algorithm
The automated timetabling and scheduling is one of the hardest problem areas. This isbecause of constraints and satisfying those constraints to get the feasible and optimizedschedule, and it is already proved as an NP Complete (1) [1]. The basic idea behind this studyis to investigate the performanc...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Högskolan Dalarna, Datateknik
2009
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:du-3791 |