Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university

DOI10.1016/J.ENDM.2017.03.016zbMath1384.90040OpenAlexW2605907435MaRDI QIDQ1687659

Malek Masmoudi, Abdelkerim Elloumi, Rahma Borchani

Publication date: 4 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.03.016

zbMATH Keywords

neighborhood structurecourse timetablingisolated lessonvariable neighborhood descent approach

Mathematics Subject Classification ID

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

Related Items (2)

A university-wide orientation course timetabling model and its modification for pandemic period ⋮ An assignment problem and its application in education domain: a review and potential path

Cites Work

• Integer programming methods for large-scale practical classroom assignment problems
• A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
• A supernodal formulation of vertex colouring with applications in course timetabling
• Lecture timetabling at a Tunisian university
• Adaptive tabu search for course timetabling
• Neighborhood portfolio approach for local search applied to timetabling problems
• A SA-VNS approach for the High School Timetabling Problem
• Search Methodologies

This page was built for publication: Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university