Educational timetabling problem with teaching load assignment using preferences and compactness

DOI10.1007/S10479-024-06242-8MaRDI QIDQ6835256zbMATH OpenFDO

Authors C. Maya-Padrón, Nancy Maribel Arratia-Martínez

Publication date 30 March 2026

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-024-06242-8

zbMATH Keywords

assignment probleminteger linear programmingmathematical modelingcourse timetabling problemeducational timetabling problem

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cites work

• A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem
• A new model for curriculum-based university course timetabling
• A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
• An integer programming formulation for a case study in university timetabling.
• Decomposition of university course timetabling. A systematic study of subproblems and their complexities
• Educational timetabling: problems, benchmarks, and state-of-the-art results
• Robust university course timetabling problem subject to single and multiple disruptions

This page was built for publication: Educational timetabling problem with teaching load assignment using preferences and compactness

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