2009
DOI: 10.1057/palgrave.jors.2602525
|View full text |Cite
|
Sign up to set email alerts
|

A genetic algorithm approach to school timetabling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
25
0
1

Year Published

2012
2012
2017
2017

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 40 publications
(26 citation statements)
references
References 36 publications
0
25
0
1
Order By: Relevance
“…The process of constructing a class schedule involves using, among others: simulated annealing [1,35,39], evolutionary algorithms [9], neural network algorithms [13], tabu search heuristics [2,4,5,8,11,12,14,20,30], genetic algorithms [10,18,36], integer programming [6,11,15,16,27,31,33] and constraint programming [19,23,25,37].…”
Section: Literature Overviewmentioning
confidence: 99%
“…The process of constructing a class schedule involves using, among others: simulated annealing [1,35,39], evolutionary algorithms [9], neural network algorithms [13], tabu search heuristics [2,4,5,8,11,12,14,20,30], genetic algorithms [10,18,36], integer programming [6,11,15,16,27,31,33] and constraint programming [19,23,25,37].…”
Section: Literature Overviewmentioning
confidence: 99%
“…Co-teaching restrictions: two or more teachers who teach the same lesson to the same class must be assigned to it at the same time period. For example, one class can be firstly joined with another class and then divided into two sub-classes, one for "English language for beginners" and one for "English language for intermediates" [22]. 7.…”
Section: Constraintsmentioning
confidence: 99%
“…Sub-classes restrictions: two or more teachers who teach different lessons to the same class at the same time period must be simultaneously assigned to it. For example, one class can be divided into two sub-classes, one for "Gymnastics" and one for "Economics" [22].…”
Section: Constraintsmentioning
confidence: 99%
“…19 A meta-heuristic is often developed in the context of a particular problem (or particular class of problem) and its performance outside of this context can therefore be variable. 20 Applications of meta-heuristics to course timetabling include: Barham and Westwood (1978);Tripathy (1980);Abramson (1991);Hertz (1991);Costa (1994);Alvarez-Valdes et al (1996);Wright (1996); Abramson et al (1999); Dimopoulou and Miliotis (2001); Mirrazavi et al (2003); Aladag et al (2009);Beligiannis et al (2009);De Causmaecker et al (2009);Moura and Scaraficci (2010);Zhang et al (2010); Al-Betar and Khader (2012); Burke et al (2012b);Geiger (2012); Pais and Amaral (2012);da Fonseca et al (2014); Lewis and Thompson (2015). 21 Applications of meta-heuristics to examinations timetabling include: Johnson (1990); Thompson and Dowsland (1998);Dimopoulou and Miliotis (2001); White et al (2004); Abdullah et al (2007); Burke et al (2010a); Özcan et al (2010); Turabieh and Abdullah (2011);Al-Betar et al (2014).…”
mentioning
confidence: 99%