Essays about: "Timetabling"
Showing result 6 - 10 of 29 essays containing the word Timetabling.
-
6. An Evaluation of the Great Deluge Algorithm in Course Timetabling : As Applied to the KTH-Inspired University Course Timetabling Problem
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The University Course Timetabling Problem (UCTP) can be loosely described as assigning events (e.g lectures) to rooms and timeslots in a way that results in a feasible timetable that is optimal according to some custom criteria. The problem has become increasingly relevant as more programs become available in universities. READ MORE
-
7. A Comparison of a Heuristic and a Hopfield Neural Network Approach for Solving Examination Timetabling Problems
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The Examination Timetabling Problem (ETP) is the problem of scheduling a number of exams during a set time period so that no students are required to sit two exams simultaneously. Despite the complexity of the problem, universities all over the world solve ETPs several times each year. READ MORE
-
8. Local search hybridization of a genetic algorithm for solving the University Course Timetabling Problem
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The University Course Timetabling Problem (UCTP) is the problem of assigning locations (lecture halls, computer rooms) and time slots (time and date) to a set of events (lectures, labs) while satisfying a number of constraints such as avoiding double-bookings. Many variants of problem formulations exist, and most realistic variants are thought to be NP-hard. READ MORE
-
9. A Comparative Study between Genetic Algorithm, Simulated Annealing and a Hybrid Algorithm for solving a University Course Timetabling Problem
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Every year, universities are faced with the problem of having to schedule events to various resources such as lecturers, classrooms and time slots while considering different constraints. The University Course Timetabling Problem is a NP-complete combinatorial optimization problem that, if solved manually, requires great investment in time and money. READ MORE
-
10. Investigating the Reliability of Known University Course Timetabling Problem Solving Algorithms with Updated Constraints
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Scheduling lectures, exams, seminars etc. for a university turns out to be a harder task than what it seems to be at first glance. This problem is known as the University Course Timetabling Problem (UCTP). READ MORE
