A case-based approach to scheduling constraints
Scheduling of production processes
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Applying Case-Based Reasoning to Autoclave Loading
IEEE Expert: Intelligent Systems and Their Applications
Massively Parallel Support for Case-Based Planning
IEEE Expert: Intelligent Systems and Their Applications
Machine Learning
Structural Similarity and Adaptation
EWCBR '96 Proceedings of the Third European Workshop on Advances in Case-Based Reasoning
Structured Cases, Trees and Efficient Retrieval
EWCBR '98 Proceedings of the 4th European Workshop on Advances in Case-Based Reasoning
The Case for Graph-Structured Representations
ICCBR '97 Proceedings of the Second International Conference on Case-Based Reasoning Research and Development
The Case for Graph-Structured Representations
ICCBR '97 Proceedings of the Second International Conference on Case-Based Reasoning Research and Development
Scheduling, Timetabling and Rostering - A Special Relationship?
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A Memetic Algorithm for University Exam Timetabling
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A Genetic Algorithm Solving a Weekly Course-Timetabling Problem
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Extensions to a Memetic Timetabling System
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
General Cooling Schedules for a Simulated Annealing Based Timetabling System
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Recent Developments in Practical Course Timetabling
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Off-the-Peg or Made-to-Measure? Timetabling and Scheduling with SA and TS
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Structural Similarity as Guidance in Case-Based Design
EWCBR '93 Selected papers from the First European Workshop on Topics in Case-Based Reasoning
Applying evolutionary computation to the school timetabling problem: The Greek case
Computers and Operations Research
Teaching assignment problem solver
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
Solving effectively the school timetabling problem using particle swarm optimization
Expert Systems with Applications: An International Journal
A case-based reasoning approach to formulating university timetables using genetic algorithms
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
A comparative study of ant colony optimization and reactive search for graph matching problems
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
A hybrid particle swarm optimization based algorithm for high school timetabling problems
Applied Soft Computing
Hi-index | 0.00 |
An earlier Case-based Reasoning (CBR) approach developed by the authors for educational course timetabling problems employed structured cases to represent the complex relationships between courses. The retrieval searches for structurally similar cases in the case base. In this paper, the approach is further developed to solve a wider range of problems. We also attempt to retrieve those cases that have common similar structures with some differences. Costs that are assigned to these differences have an input upon the similarity measure. A large number of experiments are performed consisting of different randomly produced timetabling problems and the results presented here strongly indicate that a CBR approach could provide a significant step forward in the development of automated systems to solve difficult timetabling problems. They show that using relatively little effort, we can retrieve these structurally similar cases to provide high quality timetables for new timetabling problems.