Random partial neighborhood search for the post-enrollment course timetabling problem
From MaRDI portal
Publication:1652508
DOI10.1016/j.cor.2017.09.014zbMath1391.90295OpenAlexW2755616334MaRDI QIDQ1652508
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.09.014
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
An effective hybrid local search approach for the post enrolment course timetabling problem ⋮ Simulated annealing with penalization for university course timetabling ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ An assignment problem and its application in education domain: a review and potential path
Uses Software
Cites Work
- Effective learning hyper-heuristics for the course timetabling problem
- An effective hybrid algorithm for university course timetabling
- Local search and constraint programming for the post enrolment-based course timetabling problem
- A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
- Solving the post enrolment course timetabling problem by ant colony optimization
- ITC2007 solver description: a hybrid approach
- A graph-based hyper-heuristic for educational timetabling problems
- A survey of metaheuristic-based techniques for university timetabling problems
- Neighborhood portfolio approach for local search applied to timetabling problems
- A time-predefined approach to course timetabling
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Random partial neighborhood search for the post-enrollment course timetabling problem
