Improving paper spread in examination timetables using integer programming

作者:

Highlights:

摘要

One of the desirable attributes of real-life examination timetabling solutions is the maximization of paper spread, which is a measure of the amount of study time that each student has between examinations. In this study, we face with a predefined examination schedule that must be modified in order to maximize paper spread in course of examination. We will show how the integer programming can be employed to achieve this aim. The model presents constraints for the quality of feasible examination timetables and all the requirements found in most academic institutions. The approach is tested on real-world exam timetabling problems. The computational experiments and results will be reported.

论文关键词:Examination timetabling,Assignment,Integer programming

论文评审过程:Available online 18 January 2006.

论文官网地址:https://doi.org/10.1016/j.amc.2005.11.125