A GRASP strategy for a more constrained school timetabling problem

DOI10.1504/IJOR.2010.030801zbMath1183.90185OpenAlexW2163224993MaRDI QIDQ961453

Rafael Augusto Scaraficci, Arnaldo Vieira Moura

Publication date: 30 March 2010

Published in: International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijor.2010.030801

zbMATH Keywords

schedulingmetaheuristicsGRASPlocal searchcombinatorial optimisationpath-relinkinggreedy randomized adaptive search procedureSTPBrazilschool timetabling problem

Mathematics Subject Classification ID

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

Related Items (8)

A stochastic local search algorithm with adaptive acceptance for high-school timetabling ⋮ Late acceptance hill-climbing for high school timetabling ⋮ Operational research in education ⋮ Mathematical models and algorithms for a high school timetabling problem ⋮ Investigation of Data Regularization and Optimization of Timetables by Lithuanian High Schools Example ⋮ A survey of school timetabling research ⋮ Integer programming techniques for educational timetabling ⋮ An assignment problem and its application in education domain: a review and potential path

This page was built for publication: A GRASP strategy for a more constrained school timetabling problem