paper-with-me

Papers

Optimal minimal-perturbation university timetabling with faculty preferences

2020-08-27 · Jakob Kotas, Peter Pham, Sam Koellmann

In the university timetabling problem, sometimes additions or cancellations of course sections occur shortly before the beginning of the academic term, necessitating last-minute teaching staffing changes. We present a decision-making framework that both minimizes the number of course swaps, which are inconvenient to faculty members, and maximizes faculty members' preferences for times they wish to teach. The model is formulated as an integer linear program (ILP). Numerical simulations for a hypothetical mid-sized academic department are presented.

📄 PDF Abstract BibTeX arXiv:2008.12342

Code (0)

등록된 구현이 없습니다.

Tasks

Decision Making

Similar Papers 제목 키워드 기반

Greedy Ants Colony Optimization Strategy for Solving the Curriculum Based University Course Timetabling Problem

2016-02-16 · Patrick Kenekayoro, Godswill Zipamone

Timetabling is a problem faced in all higher education institutions. The International Timetabling Competition (ITC) has published a dataset that can be used to test the quality of methods used to solve this problem. A n…

Incorporating Machine Learning to Evaluate Solutions to the University Course Timetabling Problem

2020-10-02 · Patrick Kenekayoro

Evaluating solutions to optimization problems is arguably the most important step for heuristic algorithms, as it is used to guide the algorithms towards the optimal solution in the solution search space. Research has sh…

BIG-bench Machine Learningregression

Solving the Course-timetabling Problem of Cairo University Using Max-SAT

2018-02-11 · Mohamed El Halaby

Due to the good performance of current SAT (satisfiability) and Max-SAT (maximum ssatisfiability) solvers, many real-life optimization problems such as scheduling can be solved by encoding them into Max-SAT. In this pape…

Scheduling

An Event Grouping Based Algorithm for University Course Timetabling Problem

2016-07-18 · Velin Kralev, Radoslava Kraleva, Borislav Yurukov

This paper presents the study of an event grouping based algorithm for a university course timetabling problem. Several publications which discuss the problem and some approaches for its solution are analyzed. The groupi…

University management system project.

2024-05-01 · SSRN Preprints 2024 5 · Kamal Acharya

N-Grade deals with the maintenance of university, department, faculty, student information within the university. N-Grade is an automation system, which is used to store the department, faculty, student, courses and info…

ManagementRetrieval