Practice and theory of automated timetabling V (5th international conference, PATAT 2004, Pittsburgh PA, USA, August 18-20, 2004)Burke, Edmund.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-30705-2, 1Vol, XII-353 p, isbn 3-540-30705-2Conference Proceedings

A tiling algorithm for high school timetablingKINGSTON, Jeffrey H.Lecture notes in computer science. 2005, pp 208-225, issn 0302-9743, isbn 3-540-30705-2, 1Vol, 18 p.Conference Paper

Large-scale classroom schedulingMOONEY, E. L; RARDIN, R. L; PARMENTER, W. J et al.IIE transactions. 1996, Vol 28, Num 5, pp 369-378, issn 0740-817XArticle

Finding a feasible course schedule using Tabu searchHERTZ, A.Discrete applied mathematics. 1992, Vol 35, Num 3, pp 255-270, issn 0166-218XArticle

Solving sudoku with the GAuGE systemNICOLAU, Miguel; RYAN, Conor.Lecture notes in computer science. 2006, pp 213-224, issn 0302-9743, isbn 3-540-33143-3, 1Vol, 12 p.Conference Paper

A combinatorial property of the maximum round robin tournament problemHORBACH, Andrei.Operations research letters. 2010, Vol 38, Num 2, pp 121-122, issn 0167-6377, 2 p.Article

Increasing service levels in conference and educational scheduling : a heuristic approachSAMPSON, S. E; WEISS, E. N.Management science. 1995, Vol 41, Num 11, pp 1816-1825, issn 0025-1909Article

Genetic Algorithms With Guided and Local Search Strategies for University Course TimetablingSHENGXIANG YANG; NASEEM JAT, Sadaf.IEEE transactions on systems, man and cybernetics. Part C, Applications and reviews. 2011, Vol 41, Num 1, pp 93-106, issn 1094-6977, 14 p.Article

A Genetic Algorithm for the Teacher Assignment Problem for a University in IndonesiaGUNAWAN, Aldy; NG, K. M; ONG, H. L et al.International journal of information and management sciences. 2008, Vol 19, Num 1, pp 1-16, issn 1017-1819, 16 p.Article

Evolving hyper-heuristics for the uncapacitated examination timetabling problemPILLAY, N.The Journal of the Operational Research Society. 2012, Vol 63, Num 1, pp 47-58, issn 0160-5682, 12 p.Article

A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problemPILLAY, N; BANZHAF, W.European journal of operational research. 2009, Vol 197, Num 2, pp 482-491, issn 0377-2217, 10 p.Article

A Lookup Table Model for Time-Memory Trade-Off Attacks on Binary Additive Stream CiphersERGULER, Imran; ANARIM, Emin.Lecture notes in computer science. 2006, pp 918-923, issn 0302-9743, isbn 3-540-47242-8, 1Vol, 6 p.Conference Paper

A non-standard Genetic algorithm approach to solve constrained school timetabling problemsFERNANDEZ, Cristina; SANTOS, Matilde.Lecture notes in computer science. 2003, pp 26-37, issn 0302-9743, isbn 3-540-20221-8, 12 p.Conference Paper

PATAT 2000 : practice and theory of automated timetabling III (Konstanz, 16-18 August 2000, selected papers)Burke, Edmund; Erben, Wilhelm.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42421-0, XII, 357 p, isbn 3-540-42421-0Conference Proceedings

Some complexity aspects of secondary school timetabling problemsTEN EIKELDER, H. M. M; WILLEMEN, R. J.Lecture notes in computer science. 2001, pp 18-27, issn 0302-9743, isbn 3-540-42421-0Conference Paper

A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problemsDEFU ZHANG; YONGKAI LIU; M'HALLAH, Rym et al.European journal of operational research. 2010, Vol 203, Num 3, pp 550-558, issn 0377-2217, 9 p.Article

A tabu search hyper-heuristic approach to the examination timetabling problem at the MARA university of technologyKENDALL, Graham; NAIMAH MOHD HUSSIN.Lecture notes in computer science. 2005, pp 270-293, issn 0302-9743, isbn 3-540-30705-2, 1Vol, 24 p.Conference Paper

Scheduling a major college basketball conferenceNEMHAUSER, G. L; TRICK, M. A.Operations research. 1998, Vol 46, Num 1, pp 1-8, issn 0030-364XArticle

Contribution a la résolution du problème d'emploi du temps de l'université de technologie de compiegne = Timetables in hard constraint environment: the case of U.T.CBoufflet, Jean-Paul; Trigano, Philippe.1992, 192 p.Thesis

Use of negative examples in training the HVS semantic modelJURCICEK, Filip; SVEC, Jan; ZAHRADIL, Jiri et al.Lecture notes in computer science. 2006, pp 605-612, issn 0302-9743, isbn 3-540-39090-1, 1Vol, 8 p.Conference Paper

Characterizing feasible pattern sets with a minimum number of breaksMIYASHIRO, Ryuhei; IWASAKI, Hideya; MATSUI, Tomomi et al.Lecture notes in computer science. 2003, pp 78-99, issn 0302-9743, isbn 3-540-40699-9, 22 p.Conference Paper

Modelling timetabling problems with STTLKINGSTON, Jeffrey H.Lecture notes in computer science. 2001, pp 309-321, issn 0302-9743, isbn 3-540-42421-0Conference Paper

Application of constraint hierarchy to timetabling problemsYAKHNO, Tatyana; TEKIN, Evren.Lecture notes in computer science. 2002, pp 11-18, issn 0302-9743, isbn 3-540-00028-3, 8 p.Conference Paper

A language for specifying complete timetabling problemsREIS, Luis Paulo; OLIVEIRA, Eugénio.Lecture notes in computer science. 2001, pp 322-341, issn 0302-9743, isbn 3-540-42421-0Conference Paper

A software architecture for timetable constructionKINGSTON, Jeffrey H; LYNN, Benjamin Yin-Sun.Lecture notes in computer science. 2001, pp 342-350, issn 0302-9743, isbn 3-540-42421-0Conference Paper