maxSAT-based large neighborhood search for high school timetabling

DOI10.1016/j.cor.2016.08.004zbMath1391.90651OpenAlexW2507614533MaRDI QIDQ1652069

Emir Demirović, Nysret Musliu

Publication date: 11 July 2018

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

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

zbMATH Keywords

local searchlarge neighborhood searchhigh school timetablingmaxSAT

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 (6)

Modeling high school timetabling with bitvectors ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming ⋮ Modeling and solving staff scheduling with partial weighted maxSAT ⋮ A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search ⋮ Proofs and Certificates for Max-SAT

Uses Software

• Sat4j
• Open-WBO
• XHSTT

Cites Work

• A two-stage decomposition of high school timetabling applied to cases in Denmark
• A fix-and-optimize heuristic for the high school timetabling problem
• Variable neighborhood search based algorithms for high school timetabling
• XHSTT: an XML archive for high school timetabling problems in different countries
• Integer programming for the generalized high school timetabling problem
• An XML format for benchmarks in high school timetabling
• Strong bounds with cut and column generation for class-teacher timetabling
• Modeling high school timetabling with bitvectors
• A SA-VNS approach for the High School Timetabling Problem
• Open-WBO: A Modular MaxSAT Solver,
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Unnamed Item

This page was built for publication: maxSAT-based large neighborhood search for high school timetabling