Assigning students to course sections using tabu search
From MaRDI portal
Publication:1593516
DOI10.1023/A:1018930930672zbMath0960.90053OpenAlexW2095110123MaRDI QIDQ1593516
Enric Crespo, Ramón Alvarez-Valdés, José Manuel Tamarit
Publication date: 17 January 2001
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018930930672
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items (7)
A complexity analysis and an algorithmic approach to student sectioning in existing timetables ⋮ A decomposed metaheuristic approach for a real-world university timetabling problem ⋮ Optimal student sectioning on mandatory courses with various sections numbers ⋮ Artificial life techniques for load balancing in computational grids ⋮ New integer linear programming approaches for course timetabling ⋮ A direct barter model for course add/drop process ⋮ Design and implementation of a course scheduling system using Tabu Search
This page was built for publication: Assigning students to course sections using tabu search
