University course timetabling problem using a heuristic approach based on uniform teaching resources

DOI10.13383/J.CNKI.JSE.2015.06.011zbMATH Open1349.90427MaRDI QIDQ2990970FDOQ2990970

Authors: Dezhen Zhang, Gang Chen, Ying Wang, Sai-Jun Guo, Yonghua Li 

Publication date: 10 August 2016

Recommendations

• A new model for curriculum-based university course timetabling
• New constraints and features for the university course timetabling problem
• A strategic view of university timetabling
• Timetabling problem for university as assignment of activities to resources
• A tabu search algorithm with controlled randomization for constructing feasible university course timetables

zbMATH Keywords

heuristic algorithmuniversity course timetabling problemrelational operation

Mathematics Subject Classification ID

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

Cited In (6)

• Towards improving the utilization of university teaching space
• A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
• A tabu search algorithm with controlled randomization for constructing feasible university course timetables
• Solving a real constraint satisfaction model for the university course timetabling problem: a case study
• Polynomial reduction of time-space scheduling to time scheduling
• Solving university course timetabling problems using constriction particle swarm optimization with local search

This page was built for publication: University course timetabling problem using a heuristic approach based on uniform teaching resources

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