Maximizing paper spread in examination timetabling using a vehicle routing method

Proceedings of the International Conference on Tools with Artificial Intelligence

Volumn , Issue , 2001, Pages 359-366

  Ho, Wee Kit ^a   Lim, Andrew ^a   Oon, Wee Chong ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; OPTIMIZATION; STUDENTS; VEHICLE LOCATING SYSTEMS;

CONSTRAINT SATISFACTION OPTIMIZATION PROBLEM; EXAMINATION TIMETABLING; VEHICLE ROUTING METHOD;

HEURISTIC METHODS;

EID: 0035557299     PISSN: 10636730     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. An examination scheduling model to maximize students' study time
2. Heuristics for the exam scheduling problem
3. The university exam scheduling problem
4. Computers and intractability: A guide to the theory of NP-completeness
5. The tabu search metaheuristics: How we used it
6. University examination timetabling problem
7. A hybrid-based framework for constraint satisfaction optimization problems
8. Complexity of vehicle routing and scheduling problem
9. A campus-wide university examination timetabling application
10. Development of a campus-wide university course timetabling application
11. Consistency in networks of relations
12. Combinations of GA and CSP strategies for solving the examination timetabling problem
13. Modern heuristic search methods
14. Algorithms for the vehicle routing and scheduling problem with time window constraints
15. Foundations of constraint satisfaction