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

DOI10.1016/J.COR.2019.02.013MaRDI QIDQ1734832zbMATH OpenOpenAlexWikidataFDO

Authors Taha Arbaoui, J. P. Boufflet, A. Moukrim

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

compact mathematical formulationexamination timetabling problemslower boundsspacing soft constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Novel local-search-based approaches to university examination timetabling
• Real-life examination timetabling
• Preprocessing and an improved MIP model for examination timetabling
• The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution
• A mixed-integer mathematical modeling approach to exam timetabling

Cites work

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

Cited in

(4)

• A new model for curriculum-based university course timetabling
• Exact and metaheuristic methods for a real-world examination timetabling problem
• Educational timetabling: problems, benchmarks, and state-of-the-art results
• A cut-and-branch algorithm for the external candidates examination scheduling problem

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

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