Late acceptance hill-climbing for high school timetabling

DOI10.1007/s10951-015-0458-5zbMath1347.90042OpenAlexW2197786949MaRDI QIDQ309068

Eduardo G. Carrano, George H. G. Fonseca, Haroldo Gambini Santos

Publication date: 7 September 2016

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-015-0458-5

zbMATH Keywords

local searchhigh school timetablingthird international timetabling competitionlate acceptance hill-climbing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Modeling high school timetabling with bitvectors ⋮ Parallel local search algorithms for high school timetabling problems ⋮ Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems

Uses Software

• XHSTT
• GOAL

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• GOAL solver: a hybrid local search based solver for high school timetabling
• A fix-and-optimize heuristic for the high school timetabling problem
• XHSTT: an XML archive for high school timetabling problems in different countries
• A GRASP strategy for a more constrained school timetabling problem
• Constraint programming approach for school timetabling.
• The late acceptance hill-climbing heuristic
• 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

This page was built for publication: Late acceptance hill-climbing for high school timetabling