Late acceptance hill-climbing for high school timetabling

DOI10.1007/S10951-015-0458-5zbMATH Open1347.90042OpenAlexW2197786949MaRDI QIDQ309068FDOQ309068

Authors: George H. G. Fonseca, Eduardo G. Carrano, Haroldo G. 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

Recommendations

• The late acceptance hill-climbing heuristic
• A computational study of local search algorithms for Italian high-school timetabling
• A stochastic local search algorithm with adaptive acceptance for high-school timetabling
• Metaheuristics for high school timetabling
• A step counting hill climbing algorithm applied to university examination timetabling

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)

Cites Work

• Optimization by simulated annealing
• Title not available (Why is that?)
• 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
• XHSTT: an XML archive for high school timetabling problems in different countries
• A GRASP strategy for a more constrained school timetabling problem
• The late acceptance hill-climbing heuristic
• A fix-and-optimize heuristic for the high school timetabling problem

Cited In (6)

• Modeling high school timetabling with bitvectors
• A step counting hill climbing algorithm applied to university examination timetabling
• The late acceptance hill-climbing heuristic
• Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems
• Parallel local search algorithms for high school timetabling problems
• Matheuristics vs. metaheuristics for joint lot-sizing and dynamic pricing problem with nonlinear demands

Uses Software

• XHSTT
• GOAL

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309068)