Variable neighborhood search based algorithms for high school timetabling
DOI10.1016/J.COR.2013.11.012zbMATH Open1348.90259OpenAlexW2159920763MaRDI QIDQ337210FDOQ337210
Authors: George H. G. Fonseca, Haroldo G. Santos 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.repositorio.ufop.br/handle/123456789/4240
Recommendations
- A SA-VNS approach for the high school timetabling problem
- A computational study of local search algorithms for Italian high-school timetabling
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
- GOAL solver: a hybrid local search based solver for high school timetabling
- Hybrid variable neighbourhood approaches to university exam timetabling
variable neighborhood searchhigh school timetabling problemthird international timetabling competition
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization by simulated annealing
- Title not available (Why is that?)
- Variable neighborhood search
- On the Complexity of Timetable and Multicommodity Flow Problems
- Constraint programming approach for school timetabling.
- Strong bounds with cut and column generation for class-teacher timetabling
- ITC2007 solver description: a hybrid approach
- A SA-VNS approach for the high school timetabling problem
- GOAL solver: a hybrid local search based solver for high school timetabling
- The first international nurse rostering competition 2010
- XHSTT: an XML archive for high school timetabling problems in different countries
- An integer programming formulation for a case study in university timetabling.
- Formulation space search approach for the teacher/class timetabling problem
- School Timetabling—A Case in Large Binary Integer Linear Programming
Cited In (10)
- Modeling high school timetabling with bitvectors
- Hybrid variable neighbourhood approaches to university exam timetabling
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
- Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university
- Integrating matheuristics and metaheuristics for timetabling
- A dynamic Thompson sampling hyper-heuristic framework for learning activity planning in personalized learning
- A SA-VNS approach for the high school timetabling problem
- maxSAT-based large neighborhood search for high school timetabling
- Parallel local search algorithms for high school timetabling problems
- The air traffic controller work-shift scheduling problem in Spain from a multiobjective perspective: a metaheuristic and regular expression-based approach
Uses Software
This page was built for publication: Variable neighborhood search based algorithms for high school timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337210)
