Solving the course scheduling problem by constraint programming and simulated annealing

[1]  Sanjoy Mitter,et al.  Analysis of simulated annealing for optimization , 1985, 1985 24th IEEE Conference on Decision and Control.

[2]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[3]  Edward P. K. Tsang,et al.  Applying Genetic Algorithms to Constraint Satisfaction Optimization Problems , 1990, ECAI.

[4]  Gyuri Lajos.  Complete University Modular Timetabling Using Constraint Logic Programming , 1995, PATAT.

[5]  Edmund K. Burke,et al.  Automated University Timetabling: The State of the Art , 1997, Comput. J..

[6]  D. de Werra,et al.  An introduction to timetabling , 1985 .

[7]  Andrea Schaerf,et al.  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

[8]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[10]  Brian C. Williams,et al.  Reasoning about Multiple Faults , 1986, AAAI.

[11]  Tuan-Anh Duong,et al.  Combining Constraint Programming and Simulated Annealing on University Exam Timetabling , 2004, RIVF.

[12]  Slim Abdennadher,et al.  University course timetabling using constraint handling rules , 2000, Appl. Artif. Intell..

[13]  A. Tripathy.  School Timetabling---A Case in Large Binary Integer Linear Programming , 1984 .

[14]  Jeffrey H. Kingston,et al.  The Complexity of Timetable Construction Problems , 1995, PATAT.

[15]  Mary Almond.  An Algorithm for Constructing University Timetables , 1966, Comput. J..

[16]  E. Seneta.  Non-negative Matrices and Markov Chains , 2008 .

[17]  J. Gaschnig.  Performance measurement and analysis of certain search algorithms. , 1979 .

[18]  Paul M. B. Vitányi.  How well can a graph be n-colored? , 1981, Discret. Math..

[19]  Dean Isaacson,et al.  Markov Chains: Theory and Applications , 1976 .

[20]  Alberto L. Sangiovanni-Vincentelli,et al.  A theoretical framework for simulated annealing , 1991, Algorithmica.

[21]  Sanja Petrovic,et al.  A time-predefined local search approach to exam timetabling problems , 2004 .

[22]  Patrick Prosser,et al.  HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..

[23]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[24]  Anthony Wren,et al.  Scheduling, Timetabling and Rostering - A Special Relationship? , 1995, PATAT.

[25]  David Abramson,et al.  Constructing school timetables using simulated annealing: sequential and parallel algorithms , 1991 .

[26]  H. Szu.  Fast simulated annealing , 1987 .

[27]  R. H. J. M. Otten,et al.  The Annealing Algorithm , 1989 .

[28]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..

[29]  Yves Deville,et al.  Simulated Annealing with Estimated Temperature , 2000, AI Commun..

[30]  Johan de Kleer,et al.  A Comparison of ATMS and CSP Techniques , 1989, IJCAI.

[31]  Patrice Boizumault,et al.  Building University Timetables Using Constraint Logic Programming , 1995, PATAT.

[32]  Himawan Gunadhi,et al.  Automated timetabling using an object-oriented scheduler , 1996 .

[33]  A. E. Eiben,et al.  Constraint-satisfaction problems. , 2000 .

[34]  Safaai Deris,et al.  University timetabling by constraint-based reasoning: A case study , 1997 .

[35]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[36]  Alain Hertz,et al.  Finding a feasible course schedule using Tabu search , 1992, Discret. Appl. Math..

[37]  Eugene C. Freuder,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[38]  Chris N. Potts,et al.  Constraint satisfaction problems: Algorithms and applications , 1999, Eur. J. Oper. Res..

[39]  D. Costa,et al.  A tabu search algorithm for computing an operational timetable , 1994 .