The student scheduling problem at Université de Technologie de Compiègne

作者：

Highlights：

• Preprocessing to reduce the size of the instances.

• Lower bounds that allow the quality of computed solutions to be assessed.

• Clique-based formulation for the hard conflict constraints.

• Valid inequalities.

• ILP formulations within a lexicographic optimization scheme.

摘要

•Preprocessing to reduce the size of the instances.•Lower bounds that allow the quality of computed solutions to be assessed.•Clique-based formulation for the hard conflict constraints.•Valid inequalities.•ILP formulations within a lexicographic optimization scheme.

论文关键词：University timetabling,Preprocessing,Integer programming,Valid inequalities,Lexicographical optimization

论文评审过程：Received 3 December 2020, Revised 11 February 2021, Accepted 14 February 2021, Available online 23 February 2021, Version of Record 30 March 2021.

论文官网地址：https://doi.org/10.1016/j.eswa.2021.114735