A fix-and-optimize heuristic for the high school timetabling problem

DOI10.1016/j.cor.2014.06.023zbMath1348.90251OpenAlexW2017615131MaRDI QIDQ337176

Árton P. Dorneles, Olinto C. B. de Araújo, Luciana S. Buriol

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.06.023

zbMATH Keywords

mixed integer linear programmingvariable neighborhood descenthigh school timetablingmatheuristicsfix-and-optimizeITC-2011

Mathematics Subject Classification ID

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

Related Items (25)

Relax-fix-optimize heuristics for time-relaxed sports timetabling ⋮ Late acceptance hill-climbing for high school timetabling ⋮ Developing compact course timetables with optimized student flows ⋮ Mathematical models and algorithms for a high school timetabling problem ⋮ maxSAT-based large neighborhood search for high school timetabling ⋮ Mixed integer programming based heuristics for the patient admission scheduling problem ⋮ Modeling high school timetabling with bitvectors ⋮ A multi-stage IP-based heuristic for class timetabling and trainer rostering ⋮ Parallel local search algorithms for high school timetabling problems ⋮ A dynamic Thompson sampling hyper-heuristic framework for learning activity planning in personalized learning ⋮ High quality timetables for Italian schools ⋮ A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty ⋮ Home healthcare staff dimensioning problem for temporary caregivers: a matheuristic solution approach ⋮ MIP heuristics for a resource constrained project scheduling problem with workload stability constraints ⋮ Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty ⋮ Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem ⋮ The coupled task scheduling problem: an improved mathematical program and a new solution algorithm ⋮ Fix-and-optimize procedures for solving the long-term unit commitment problem with pumped storages ⋮ Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure ⋮ Inbound and outbound flow integration for cross-docking operations ⋮ A column generation approach to high school timetabling modeled as a multicommodity flow problem ⋮ Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost ⋮ Handling fairness issues in time-relaxed tournaments with availability constraints ⋮ Modeling interdependencies in infrastructure systems using multi-layered network flows ⋮ The multiphase course timetabling problem

Uses Software

• CPLEX
• XHSTT

Cites Work

• Unnamed Item
• Unnamed Item
• A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
• XHSTT: an XML archive for high school timetabling problems in different countries
• School timetabling for quality student and teacher schedules
• A computational study of local search algorithms for Italian high-school timetabling
• Decomposition, reformulation, and diving in university course timetabling
• Distribution requirements and compactness constraints in school timetabling
• Strong bounds with cut and column generation for class-teacher timetabling
• Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
• Mixed Integer Programming Computation
• Matheuristics
• Production Planning by Mixed Integer Programming
• Variable neighborhood search: Principles and applications

This page was built for publication: A fix-and-optimize heuristic for the high school timetabling problem