Simulated annealing with penalization for university course timetabling
From MaRDI portal
Publication:6090224
DOI10.1007/s10951-022-00747-5zbMath1527.90109OpenAlexW4285891591MaRDI QIDQ6090224
Edon Gashi, Adrian Ymeri, Kadri Sylejmani
Publication date: 14 November 2023
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-022-00747-5
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
- An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
- Random partial neighborhood search for the post-enrollment course timetabling problem
- Local search and constraint programming for the post enrolment-based course timetabling problem
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling
- A simulated annealing algorithm for university course timetabling considering travelling distances
- ITC2007 solver description: a hybrid approach
- An overview of curriculum-based course timetabling
- Adaptive tabu search for course timetabling
- A simulated annealing and hill-climbing algorithm for the traveling tournament problem
- Convergence of an annealing algorithm
- Simulated Annealing with a Temperature Dependent Penalty Function
- The Theory and Practice of Simulated Annealing
- Stochastic Tunneling Approach for Global Minimization of Complex Potential Energy Landscapes
This page was built for publication: Simulated annealing with penalization for university course timetabling