Variable neighborhood search based algorithms for high school timetabling

DOI10.1016/j.cor.2013.11.012zbMath1348.90259OpenAlexW2159920763MaRDI QIDQ337210

George H. G. Fonseca, Haroldo Gambini 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

zbMATH Keywords

variable neighborhood searchhigh school timetabling problemthird international timetabling competition

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

maxSAT-based large neighborhood search for high school timetabling ⋮ Integrating matheuristics and metaheuristics for timetabling ⋮ Modeling high school timetabling with bitvectors ⋮ Parallel local search algorithms for high school timetabling problems ⋮ A dynamic Thompson sampling hyper-heuristic framework for learning activity planning in personalized learning ⋮ The air traffic controller work-shift scheduling problem in Spain from a multiobjective perspective: a metaheuristic and regular expression-based approach

Uses Software

• XHSTT
• GOAL

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• 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
• Variable neighborhood search
• An integer programming formulation for a case study in university timetabling.
• 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
• School Timetabling—A Case in Large Binary Integer Linear Programming
• Formulation space search approach for the teacher/class timetabling problem
• On the Complexity of Timetable and Multicommodity Flow Problems

This page was built for publication: Variable neighborhood search based algorithms for high school timetabling