A GRASP strategy for a more constrained School Timetabling Problem

Arnaldo Vieira Moura and Rafael Augusto Scaraficci

International Journal of Operational Research, 2010, vol. 7, issue 2, 152-170

Abstract: This work treats a more constrained School Timetabling Problem (STP). It consists of scheduling a set of lectures and teachers in a prefixed period of time, satisfying a set of operational requirements. We applied a Greedy Randomized Adaptive Search Procedure (GRASP) heuristic, combined with a path-relinking improvement. During execution of the GRASP heuristic, the local search procedure interleaves two types of movements. In addition, the path-relinking strategy was itself enhanced by a local search procedure. The algorithms were tested with real instances and proved to be good approaches to solve this problem. Although some restrictions are specific to Brazilian educational institutions, the same ideas can inspire similar approaches for solving the STP in other situations.

Keywords: combinatorial optimisation; Greedy Randomized Adaptive Search Procedure; GRASP; local search; metaheuristics; path-relinking; school timetabling problem; STP; scheduling; Brazil. (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://www.inderscience.com/link.php?id=30801 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:7:y:2010:i:2:p:152-170

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().