A GRASP strategy for a more constrained school timetabling problem

DOI10.1504/IJOR.2010.030801MaRDI QIDQ961453zbMATH OpenOpenAlexFDO

Authors Arnaldo Vieira Moura, Rafael Augusto Scaraficci

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

metaheuristicslocal searchcombinatorial optimisationschedulingGRASPpath-relinkinggreedy randomized adaptive search procedureSTPBrazilschool timetabling problem

Mathematics Subject Classification ID

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

Recommendations

• School timetabling problem
• Constructing Good Solutions for the Spanish School Timetabling Problem
• Constraint programming approach for school timetabling.
• Towards constraint-based school timetabling
• A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem

Cited in

(9)

• A stochastic local search algorithm with adaptive acceptance for high-school timetabling
• A survey of school timetabling research
• Investigation of data regularization and optimization of timetables by Lithuanian high schools example
• An assignment problem and its application in education domain: a review and potential path
• School timetabling problem
• Late acceptance hill-climbing for high school timetabling
• Operational research in education
• Mathematical models and algorithms for a high school timetabling problem
• Integer programming techniques for educational timetabling

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

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