10 papers · ranked by Valyu relevance
Clara Chaplin, Gai, Stanley, Samuel C. Gutekunst + 6 more
Methodology: We worked in close collaboration with the Registrar's Office. First, we created visualization tools to help their manual scheduling process. Then we designed integer programming models and heuristics to produce a portfolio of possible exam schedules. Finally, we developed open-source, user-friendly…
Ravneil Nand, Bibhya Sharma, Kaylash Chaudhary, Yilun Shang
In recent times, there has been a growing attention to intelligent optimization algorithms centred on swarm principles such as the firefly algorithm (FA). It was proposed for the continuous domain that mimics the attraction of fireflies to flashing light and has been used in discrete domains via modification. A…
Arindam Chaudhuri, Kajal De
Examination Timetable Problem (ETP) is NP–Hard combinatorial optimization problem. It has received tremendous research attention during the past few years given its wide use in universities. ETP can be defined as assignment of courses to be examined, candidates to time periods and examination rooms while satisfying a…
Bernd Bassimir, Rolf Wanka
In the literature the examination timetabling problem (ETTP) is often considered a post-enrollment problem (PE-ETTP). In the real world, universities often schedule their exams before students register using information from previous terms. A direct consequence of this approach is the uncertainty present in the…
Matthew Davison, Ahmed Kheiri, Konstantinos G. Zografos
The university course timetabling problem is a challenging problem to solve. As universities have evolved, the features of this problem have changed. One emerging feature is hybrid teaching where classes can be taught online, in-person or a combination of both in-person and online. This work presents a multi-objective…
Matthew E.H. Petering, Mohammad Khamechian
Problem definition: Scheduling university courses is extra challenging when classroom capacities are reduced because of social distancing requirements that are implemented in response to a pandemic such as COVID-19. Methodology: In this work, we propose an expanded taxonomy of course delivery modes, present an integer…
Ayşe Aslan
This paper provides experimental experiences on two local search hybridized genetic algorithms in solving the uncapacitated examination timetabling problem. The proposed two hybrid algorithms use partition and priority based solution representations which are inspired from successful genetic algorithms proposed for…
Fabian Dunke, Stefan Nickel
Course timetables are the organizational foundation of a university’s educational program. While students and lecturers perceive timetable quality individually according to their preferences, there are also collective criteria derived normatively such as balanced workloads or idle time avoidance. A recent challenge and…
Rubén Ruiz-Torrubiano, Sebastian Knopp, Andreas Krystallidis, Lukas Matthias Wolf
'Lukas Matthias Wolf'] In modular educational systems, students are allowed to choose a part of their curriculum themselves. The rationale behind letting students choose their courses themselves is to enhance self-responsibility, improve student motivation, and allow for focus on specific areas of interest. A central…
Emir Demirović, Nysret Musliu
High school timetabling (HSTT) is a well known and wide spread problem. The problem consists of coordinating resources (e.g. teachers, rooms), times, and events (e.g. lectures) with respect to various constraints. Unfortunately, HSTT is hard to solve and just finding a feasible solution for simple variants of HSTT has…