Open AccessProceedings Article
A two phase integer linear programming approach to solving the school timetable problem
Samir Ribic,Samim Konjicija +1 more
- 21 Jun 2010
- pp 651-656
19
TL;DR: This paper proposes one model for high school timetable generation, which uses two-phase linear integer programming to solve the problem, by decomposing the problem to determine the day and then, in the second phase, to generate a daily schedule.
read more
Abstract: In this paper, we propose one model for high school timetable generation, which uses two-phase linear integer programming to solve the problem. This reduces the required computation time, by decomposing the problem to determine the day and then, in the second phase, to generate a daily schedule. The approach was demonstrated on a test problem, and the results for various settings of the model parameters are presented.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A survey of school timetabling research
TL;DR: An overview of the research conducted in this domain is provided, details of problem sets which are publicly available and areas for further research in school timetabling are proposed.
133
A Comprehensive Study of Educational Timetabling - a Survey
Simon Kristiansen,Thomas Jacob Riis Stidsen +1 more
- 01 Jan 2013
TL;DR: This survey is concentrated on the four main education planning problems; University Course Timetabling, High School Timetables, ExaminationTimetabling and Student Sectioning.
A graph edge colouring approach for school timetabling problems
TL;DR: A school timetabling problem is solved using a graph edge coloring algorithm in two phases to get daily requirement matrices for each day of the week from weekly requirement matrix obtained by solving system of linear equations for the variables taking integer values.
6
University course timetabling and the requirements: Survey in several universities in the east-coast of Malaysia
Nurul Liyana Abdul Aziz,Nur Aidya Hanum Aizam +1 more
- 07 Aug 2017
TL;DR: In this article, the authors investigated through surveys to several universities in the east coast of Malaysia the demands and preferences of individuals involved directly, and all current issues regarding the demands will be included into our existing general university course t...
6
Implementasi algoritma integer linear programming untuk sistem informasi penjadwalan ruangan di fakultas ilmu komputer universitas indonesia
Elly Matul Imah,A.R. Hutomo,A. Fitrananda,A. Marshadiany,G.P. Prikarti +4 more
- 15 Jul 2012
TL;DR: The ILP algorithm for ILP is the most appropriate model to solve the timetabling problem in Fasilkom UI and can minimize the time required to perform the scheduling of a month becomes a matter of minutes.
6
References
A Survey of Automated Timetabling
TL;DR: A large number of variants of the timetabling problem have been proposed in the literature, which differ from each other based on the type of institution involved (university or school) and the types of constraints as mentioned in this paper.
An integer programming formulation for a case study in university timetabling
TL;DR: A novel 0–1 integer programming formulation of the university timetabling problem is presented and it is shown that this model is solvable by existing software tools with IP solvers, even for large departments.
290
Efficient solutions for a university timetabling problem through integer programming
Sophia Daskalaki,Theodore Birbas +1 more
TL;DR: A two-stage relaxation procedure that solves efficiently the integer programming formulation of a university timetabling problem and gives a chance for further improvements in the final timetables as well as for certain degree of interaction with the users during the construction of the timetables.
150
Tabu search techniques for large high-school timetabling problems
Andrea Schaerf
- 01 Jan 1996
TL;DR: In this paper, a solution algorithm based on tabu search was proposed to solve the high school timetabling problem, which is NP-complete and is usually tackled using heuristic methods.
98