A time-predefined approach to course timetabling
From MaRDI portal
Recommendations
- An adaptive flex-deluge approach to university exam timetabling
- Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- A tabu search algorithm to solve a course timetabling problem
- A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
Cited in
(16)- Profile-assisted instruction scheduling
- Optimal block design models for course timetabling
- Random partial neighborhood search for the post-enrollment course timetabling problem
- Improved local search approaches to solve the post enrolment course timetabling problem
- A harmony search algorithm for university course timetabling
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling
- Solving the post enrolment course timetabling problem by ant colony optimization
- Hybrid heuristics for examination timetabling problem
- Comparison of metaheuristic algorithms for examination timetabling problem
- On the performance of scatter search for post-enrolment course timetabling problems
- A decomposed metaheuristic approach for a real-world university timetabling problem
- A survey of metaheuristic-based techniques for university timetabling problems
- An adaptive flex-deluge approach to university exam timetabling
- A simulated annealing hyper-heuristic methodology for flexible decision support
- A continuous timetable with m, m – 2, or 2 instructor’s class hours
- An effective hybrid algorithm for university course timetabling
This page was built for publication: A time-predefined approach to course timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3155573)
