Exam timetabling with allowable conflicts within a time window

Computers & Industrial Engineering(2019)

引用 16|浏览4
暂无评分
摘要
•We introduce an MIP that captures all the studied constraints.•The proposed formulation can solve small sized problems using commercial software.•We propose heuristics to solve medium and large sized problem.•Results show that the proposed heuristics obtain optimal and close-to-optimal solutions.
更多
查看译文
关键词
Exam timetabling,NP-complete problem,Integer programming,Largest box algorithm,Graph theory,Case studies
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要