Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems

DOI10.1016/J.COR.2019.02.013zbMath1458.90248OpenAlexW2915073104WikidataQ128315687 ScholiaQ128315687MaRDI QIDQ1734832

Aziz Moukrim, Taha Arbaoui, Jean-Paul Boufflet

Publication date: 27 March 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.02.013

zbMATH Keywords

lower boundsexamination timetabling problemscompact mathematical formulationspacing soft constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Exact and metaheuristic methods for a real-world examination timetabling problem ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ A new model for curriculum-based university course timetabling

Cites Work

• A step counting hill climbing algorithm applied to university examination timetabling
• A column generation approach for solving the examination-timetabling problem
• Hybrid bee colony optimization for examination timetabling problems
• A constructive approach to examination timetabling based on adaptive decomposition and ordering
• Preprocessing and an improved MIP model for examination timetabling
• A survey of search methodologies and automated system development for examination timetabling
• Improving paper spread in examination timetables using integer programming
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
• Recent research directions in automated timetabling
• A fast algorithm for the maximum clique problem
• The late acceptance hill-climbing heuristic
• An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
• A new model for automated examination timetabling
• ITC2007 solver description: a hybrid approach
• Feature-based tuning of single-stage simulated annealing for examination timetabling
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems

This page was built for publication: Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems