Skip to main content
Article thumbnail
Location of Repository

Structured cases in case-based reasoning: re-using and adapting cases for time-tabling problems

By Edmund Burke, Bart L. MacCarthy, Sanja Petrovic and Rong Qu


In this paper, we present a case-based reasoning (CBR) approach solving educational time-tabling problems. Following the basic idea behind CBR, the solutions of previously solved problems are employed to aid finding the solutions for new problems. A list of feature-value pairs is insufficient to represent all the necessary information. We show that attribute graphs can represent more information and thus can help to retrieve re-usable cases that have similar structures to the new problems. The case base is organised as a decision tree to store the attribute graphs of solved problems hierarchically. An example is given to illustrate the retrieval, re-use and adaptation of structured cases. The results from our experiments show the effectiveness of the retrieval and adaptation in the proposed method

Year: 2000
OAI identifier:
Provided by: Nottingham ePrints

Suggested articles


  1. (1993). A case-based approach to scheduling constraints, in:
  2. (1995). A case-based expert system for scheduling problems with sequence dependent set up times, in:
  3. (2000). A comparison of annealing techniques for academic course timetabling, in: [34] 92-112. Knowledge-Based Systems,
  4. A genetic algorithm solving a weekly course-timeatbling problem, in:
  5. A memetic algorithm for university exam timetabling, in:
  6. (1999). A multi-stage evolutionary algorithm for the timetable problem,
  7. A smart genetic algorithm for university timetabling, in:
  8. (1994). A university timetabling system based on graph colouring and constraint manipulation,
  9. (1998). Adaptation-guided retrieval: questioning the similarity assumption in reasoning,
  10. (1994). Adaptive case-based control of scheduling revision, in:
  11. (1992). Applying case-based reasoning to autoclave loading, doi
  12. (1998). Case-based reasoning for production scheduling, doi
  13. (1996). Case-based reasoning in scheduling, in:
  14. (1997). Case-based reasoning in scheduling: reusing solution components, doi
  15. (1994). Case-based reasoning: a review,
  16. (1979). Computers and Intractability: A Guide to the Theory of NPCompleteness, (Freeman and Company.
  17. (1995). Cumming A and Luchian H, The use of local search suggestion lists for improving the solution of timetable problems with evolutionary algorithms,
  18. (1995). Efficient graph matching algorithms for preprocessed model graph, PhD thesis,
  19. Extensions to a memetic timetabing system, in:
  20. General cooling schedules for a simulate annealing based timetabling system, in:
  21. (1998). Initialisation strategies and diversity in evolutionary timetabling,
  22. (1994). Massively parallel support for case-based planning,
  23. (1995). Methods and systems for case retrieval exploiting the case structure, FABEL-Report 39, GMD, Sankt Augustin,
  24. (1993). Nonstandard concepts of similarity in case-based reasoning,
  25. Off-the-peg or made to measure? Timetabling and scheduling with SA and TS,
  26. (1996). Pippig E and Tammer EC, Structural similarity and adaptation, in:
  27. Recent developments in practical course timetabling, in:
  28. Recent developments in practical examination timetabling, in:
  29. Scheduling timetabling and rostering – a special relationship, in:
  30. (1989). SMARTlan: A case-based resource allocation and scheduling system, in:
  31. Some observations about GA-based exam timetabling, in:
  32. (1993). Structural similarity as guidance in case-based design,
  33. (1998). Structured cases, trees and efficient retrieval, to appear in
  34. (1997). The case for graph-structured representations, to appear in
  35. Three methods to solve an examination timetable problem, in:

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.