Automated university timetabling: The state of the art
E Burke, K Jackson, JH Kingston… - The computer …, 1997 - academic.oup.com
Scheduling lectures or exams for universities is a large and complex task. There are many
different departments and faculties, each with their own ideas about how and when their …
different departments and faculties, each with their own ideas about how and when their …
[图书][B] The practical handbook of genetic algorithms: applications
LD Chambers - 2000 - taylorfrancis.com
Rapid developments in the field of genetic algorithms along with the popularity of the first
edition precipitated this completely revised, thoroughly updated second edition of The …
edition precipitated this completely revised, thoroughly updated second edition of The …
A survey of metaheuristic-based techniques for university timetabling problems
R Lewis - OR spectrum, 2008 - Springer
As well as nearly always belonging to the class of NP-complete problems, university
timetabling problems can be further complicated by the often idiosyncratic requirements …
timetabling problems can be further complicated by the often idiosyncratic requirements …
[图书][B] Metaheuristics for university course timetabling
R Lewis, B Paechter, O Rossi-Doria - 2007 - Springer
In this chapter we consider the NP-complete problem of university course timetabling. We
note that it is often difficult to gain a deep understanding of these sorts of problems due to …
note that it is often difficult to gain a deep understanding of these sorts of problems due to …
Electronic lecture time-table scheduler using genetic algorithm
Lecture time-tabling preparation has always been known as a typical scheduling problem
that is time consuming, energy sapping and often leading to general apathy and waste of …
that is time consuming, energy sapping and often leading to general apathy and waste of …
[PDF][PDF] Comparison of simulated annealing and hill climbing in the course timetabling problem
K Patrick - African Journal of Mathematics and Computer …, 2012 - academicjournals.org
Course timetabling is a task that must be performed by all higher institutions. It is very difficult
doing this manually and even classified as nondeterministic polynomial (NP) complete in …
doing this manually and even classified as nondeterministic polynomial (NP) complete in …
Feature selection in a fuzzy student sectioning algorithm
M Amintoosi, J Haddadnia - … and Theory of Automated Timetabling V: 5th …, 2005 - Springer
In this paper a new student sectioning algorithm is proposed. In this method a fuzzy
clustering, a fuzzy evaluator and a novel feature selection method is used. Each student has …
clustering, a fuzzy evaluator and a novel feature selection method is used. Each student has …
[PDF][PDF] A framework for university's final exam timetable allocation using genetic algorithm
A Rozaimee, AN Shafee, NAA Hadi… - World Applied …, 2017 - researchgate.net
Nowadays mostly all of the human tasks were replaced or at least assisted by the use of
computer system to ensure the task in completed in timely manner. This includes the …
computer system to ensure the task in completed in timely manner. This includes the …
An enhanced genetic algorithm-based timetabling system with incremental changes
AF AbouElhamayed, AS Mahmoud… - … & Systems (ICCES), 2016 - ieeexplore.ieee.org
Constructing a timetable is a widespread problem. Computers can be employed to solve this
problem faster and to produce better solutions. Software solutions for this problem already …
problem faster and to produce better solutions. Software solutions for this problem already …
[PDF][PDF] A Smart e-School Framework
CY Han, JE Gilbert - management, 2000 - Citeseer
Internet and new computer technology impact educational institutions directly in many of
their essential and yet diverse operations. However, there seems to be no holistic solution in …
their essential and yet diverse operations. However, there seems to be no holistic solution in …