The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 41 of The Journal of the Operational Research Society Vol. 60, Issue 1
[page]
2009
The Journal of the Operational Research Society
Preserved Fulltext
Local techniques for large high school timetabling problems. JEEE Trans Systems Man and Cybernet—Part A: Systems Hum 29: 368-377
Schaerf A (1999). A survey of automated timetabling. ...
A column generation approach for the timetabling problem of greek high schools. J Op! Res Soc 54(3): 230-238.
Perzina R (2006). ...
A survey of school timetabling research
2013
Annals of Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Furthermore, there have been no comparative studies on the success of different methodologies on a variety of school timetabling problems. ...
As a way forward this paper provides an overview of the research conducted in this domain, details of problem sets which are publicly available and proposes areas for further research in school timetabling ...
Colorni et al. (1998) compare the performance of simulated annealing, tabu search with local search and genetic algorithms in solving the school timetabling problem for two Italian high schools. ...
doi:10.1007/s10479-013-1321-8
fatcat:zrolp4bc4vfflg2olvy2ecquui
A stochastic local search algorithm with adaptive acceptance for high-school timetabling
2014
Annals of Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Automating high school timetabling is a challenging task. This problem is a well known hard computational problem which has been of interest to practitioners as well as researchers. ...
High schools need to timetable their regular activities once per year, or even more frequently. The exact solvers might fail to find a solution for a given instance of the problem. ...
Acknowledgement This work is supported in part by the UK EPSRC under grant EP/F033214/1 -The LANCS Initiative in Foundational Operational Research: Building Theory for Practice. ...
doi:10.1007/s10479-014-1660-0
fatcat:jgf3aekkwrghpd2obh7y4ibicq
Local search techniques for large high school timetabling problems
1999
IEEE transactions on systems, man and cybernetics. Part A. Systems and humans
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
The high-school timetabling problem regards the weekly scheduling for all the lectures of a high school. ...
This paper describes a solution algorithm (and its implementation) based on local search techniques. ...
Acknowledgements I wish to thank Amedeo Cesta, Giansalvatore Mecca, Marco Schaerf, and one anonymous reviewer for valuable comments on earlier drafts of this paper. ...
doi:10.1109/3468.769755
fatcat:hp3gxojjgbec5fgztt6phpkg7i
The Interleaved Constructive Memetic Algorithm and its application to timetabling
2012
Computers & Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
We also describe a real-world course timetabling problem, the "Preparation School Timetabling Problem" (PSTP), which is of particular interest because it has a highly hierarchical structure arising from ...
For such problems, we present a new hybrid method, "Interleaved Constructive Memetic Algorithm" (ICMA) that interleaves memetic algorithms with constructive methods. ...
Schaerf (1996) [17] tested tabu search for high-school course timetabling on different school data using a tool with an interactive interface. ...
doi:10.1016/j.cor.2011.11.020
fatcat:aquk6zrcgzawdkt5uzg76nj4qm
A Hidden Markov Model Approach to the Problem of Heuristic Selection in Hyper-Heuristics with a Case Study in High School Timetabling Problems
2017
Evolutionary Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A hidden Markov model approach to the problem of heuristic selection in hyper-heuristics with a case study in high school timetabling problems. ...
In this study, we present an easy-to-implement, easy-to-maintain and effective sequence-based selection hyper-heuristic to solve high school timetabling problems using a benchmark of unified real-world ...
The authors would like to thank David Walker for developing the simulator presented in the results section. ...
doi:10.1162/evco_a_00186
pmid:27258841
fatcat:rmqwem22irdwpgissxxc2vd5gu
A heuristic solution to the university timetabling problem
2009
Engineering computations
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The sensitivity analysis of the algorithm parameters is very valuable in guiding actual application development for the problem. ...
Design/methodology/approach -A genetic algorithm metaheuristic is designed to handle a real-life case study. ...
The university timetabling problem ...
doi:10.1108/02644400910996853
fatcat:g2ir4eghwvfcrdy6q6qoky2fmu
A greedy gradient-simulated annealing hyper-heuristic for a curriculum-based course timetabling problem
2012
2012 12th UK Workshop on Computational Intelligence (UKCI)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Hyper-heuristics which search the space of heuristics for high quality solutions are alternative methods that have been increasingly used in solving such problems. ...
In this study, a curriculum based course timetabling problem at Yeditepe University is described. ...
Schaerf [19] proposed an interactive interface for timetabling and embedded TS as a search tool for solving some high-school course timetabling problems. Paechter et al. ...
doi:10.1109/ukci.2012.6335754
dblp:conf/ukci/KalenderKOB12
fatcat:vievxckt3nhwlj3rvqsi4dhpli
Parallel Genetic Algorithms for University Scheduling Problem
2017
International Journal of Electrical and Computer Engineering (IJECE)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
With the emergence of multi-core systems, the parallel implementation was considered for finding the solution. ...
University scheduling timetabling problem, falls into NP hard problems. Re-searchers have tried with many techniques to find the most suitable and fastest way for solving the problem. ...
A specific case study of an Italian school timetable was presented by the authors of [3] , by using genetic algorithms. ...
doi:10.11591/ijece.v7i2.pp1096-1102
fatcat:jvcfu34ehnginfbi3dz7zodhju
Neighborhood Portfolio Approach for Local Search Applied to Timetabling Problems
2005
Journal of Mathematical Modelling and Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
A recent trend in local search concerns the exploitation of several different neighborhoods so as to increase the ability of the algorithm to navigate the search space. ...
The experimental analysis shows that our approach leads to automatic design of new algorithms that provide better results than basic local search techniques. ...
This work has been partly funded by the Italian Ministry of Education, University and Research (MIUR) under the project PRIN 2003 "Design and implementation of a solver based on local search for the execution ...
doi:10.1007/s10852-005-9032-z
fatcat:gjvudy3labcnzfug4n62nhlcla
Scheduling in sports: An annotated bibliography
2010
Computers & Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Based on the second model a heuristic solution algorithm is proposed, which proceeds in two stages using local search and genetic algorithms. [ Timetables for a time-relaxed scheduling problem in a nonprofessional ...
A constructive heuristic and a local search procedure are developed for its solution. ...
TTP benchmark instances and real-life instances are in- The hardness of optimization problems in sports scheduling is also driving research on new algorithmic directions for clusters and computational ...
doi:10.1016/j.cor.2009.05.013
fatcat:dznvxw2ulvhk3gdvpybw324spa
COTTAPP: An Online University Timetable Application based on a Goal Programming Model
2017
International Journal of Intelligent Systems and Applications in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The web application and the underlying optimization model is illustrated by using a case study of an undergraduate program of industrial engineering. ...
Preparing university course timetables is a challenging task as many constraints and requirements from the university and lecturers must be satisfied without overlapping courses for different student groups ...
[9] used metaheuristic approaches, including simulated annealing, tabu-search and two genetic algorithms, for solving the timetabling problem in an Italian high school and compared the results of these ...
doi:10.18201/ijisae.2017531426
fatcat:pflvkmvt6bfznmog6rvuig5yiy
Metaheuristics for University Course Timetabling
[chapter]
2007
Studies in Computational Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Using a popular benchmark version of a university course timetabling problem, we examine the implications of using a "twostaged" algorithmic approach, whereby in stage-one only the mandatory constraints ...
Two new metaheuristic algorithms are also proposed for the second stage of the twostaged approach: an evolutionary algorithm (with a number of new specialised evolutionary operators), and a simulated annealing-based ...
tt, the quality of tt can be calculated using the formula: in [35] [36] [37] where an evolutionary algorithm (EA) is proposed for a timetabling problem based on an Italian high school. ...
doi:10.1007/978-3-540-48584-1_9
fatcat:zfnn2lx65fe5dbsyyxrqs73wga
Adaptive large neighborhood search for the curriculum-based course timetabling problem
2016
Annals of Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Hartl Acknowledgement I would like to thank the people at the chair of Production and Operations Management of the University of Vienna for their support. ...
Hartl for giving me the opportunity to write the thesis at his chair, Alexander Schnell, MSc for his advices and his critical review of the thesis and Mag. ...
Acknowledgement I would like to thank the people at the chair of Production and Operations Man- ...
doi:10.1007/s10479-016-2151-2
fatcat:rj3s47ql25bppijejwupqfvhde
Constraint satisfaction problems: Algorithms and applications
1999
European Journal of Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The aim of this paper is to introduce constraint satisfaction to the operational researcher. We start by de®ning CSPs, and describing the basic techniques for solving them. ...
Many combinatorial problems in operational research, such as scheduling and timetabling, can be formulated as CSPs. ...
algorithms. ...
doi:10.1016/s0377-2217(98)00364-6
fatcat:jc64g2qlcndupnx3oh6c7frkay
« Previous
Showing results 1 — 15 out of 456 results