Name
Abstract | ||
|---|---|---|
The timetabling problem is a high-dimensional, non-Euclidean, multi-constraint combinational optimization problem. Given, data sets of classes, their days and instructors;. rooms and their capacities, types; students and their preferences and requirements; the problem is to construct a feasible class schedule satisfying all the hard constraints and minimizing the medium and soft constraints. We apply Genetic Algorithms (GAs) to solve the scheduling problem mapped from the Faculty of Science at University of Jordan. This technique has achieved very good results compared to the hand made schedule result produced by the registration department. |
Year | Venue | Keywords |
|---|---|---|
2002 | Lecture Notes in Computer Science | genetic algorithm methods,course scheduling,scheduling,constrained optimization,genetic algorithm |
Field | DocType | Volume |
Mathematical optimization,Data set,Job shop scheduling,Scheduling (computing),Computer science,Artificial intelligence,Timetabling problem,Optimization problem,Machine learning,Genetic algorithm,Constrained optimization | Conference | 2358 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-43781-9 | 0 |
PageRank | References | Authors |
0.34 | 1 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Raed Abu Zitar | 1 | 87 | 10.95 |