Case-based reasoning in course timetabling: An attribute graph approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2080, Issue , 2001, Pages 90-104

  Burke, Edmund K ^a   MacCarthy, Bart ^a   Petrovic, Sanja ^a   Qu, Rong ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; SCHEDULING;

ATTRIBUTE GRAPHS; AUTOMATED SYSTEMS; CASE-BASED REASONING APPROACHES; COMPLEX RELATIONSHIPS; COURSE TIMETABLING; HIGH QUALITY; SIMILARITY MEASURE; TIMETABLING PROBLEM;

CASE BASED REASONING;

EID: 84956675924     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44593-5_7     Document Type: Conference Paper

References (33)

1. Koton P.: SMARTlan: A Case-Based Resource Allocation and Scheduling System. In: Proceedings: Workshop on Case-based Reasoning (DARPA). (1989) 285-289
2. Hennessy D., Hinkle D.: Applying Case-Based Reasoning to Autoclave Loading. IEEE Expert. (1992) 7: 21-26
3. Bezirgan A.: A Case-Based Approach to Scheduling Constraints. In: Dorn J., Froeschl K.A. (eds): Scheduling of Production Processes. Ellis Horwood Limited. (1993) 48-60
4. Miyashita K., Sycara K.: Adaptive Case-Based Control of Scheduling Revision. In: Zweben M., Fox M.S. (eds): Intelligent Scheduling. Morgan Kaufmann. (1994) 291-308
5. MacCarthy B., Jou P.: Case-Based Reasoning in Scheduling. In: Khan M.K., Wright C.S. (eds.): Proceedings of the Symposium on Advanced Manufacturing Processes, Systems and Techniques (AMPST96). MEP Publications Ltd. (1996) 211-218
6. MacCarthy B. Jou P.: A Case-Based Expert System for Scheduling Problems with Sequence Dependent Set Up Times. In: Adey R.A., Rzevski G. (eds): Applications of Artificial Intelligence. In: Engineering X. Computational Machines Publications: Southampton. (1995) 89-96
7. Cunningham P., Smyth B.: Case-Based Reasoning in Scheduling: Reusing Solution Components. The International Journal of Production Research. (1997) 35: 2947-2961
8. Schmidt G.: Case-Based Reasoning for Production Scheduling. International Journal of Production Economics. (1998) 56-57: 537-546
9. Wren V.: Scheduling, Timetabling and Rostering - A Special Relationship? In: Burke E.K., Ross P. (eds.): The Practice and Theory of Automated Timetabling I. Lecture Notes in Computer Science 1153. Springer-Verlag: Berlin (1996) 46-75
10. Carter M.W., Laporte G.: Recent Developments in Practical Course Timetabling. Burke E.K., Carter M. (eds.): The Practice and Theory of Automated Timetabling II. Lecture Notes in Computer Science 1408. Springer-Verlag: Berlin (1998) 3-19
11. Werra D.: Graphs, Hypergraphs and Timetabling. Methods of Operations Research (Germany F.R.). (1985) 49: 201-213
12. Tripathy A.: School Timetabling - A Case in Large Binary Integer Linear Programming. Management Science. (1984) 30:1473-1489
13. Dowsland K.A.: Off-the-Peg or Made to Measure Timetabling and Scheduling with SA and TS. In: The Practice and Theory of Automated Timetabling: Selected Papers from the 2nd International Conference. Springer-Verlag: Berlin. (Lecture Notes in Computer Science 1408). (1998) 37-52
14. Thomson J.M., Dowsland K.A.: General Cooling Schedules for a Simulate Annealing Based Timetabling System. In: Burke E.K., Ross P. (eds.): The Practice and Theory of Automated Timetabling I. Lecture Notes in Computer Science 1153. Springer-Verlag: Berlin (1996) 345-364
15. Erben W., Keppler J.: A Genetic Algorithm Solving a Weekly Course-Timeatbling Problem. In: Burke E.K., Ross P. (eds.): The Practice and Theory of Automated Timetabling I. Lecture Notes in Computer Science 1153. Springer-Verlag: Berlin (1996) 198-211
16. Burke E.K., Newell J.P., Weare R.F.: A Memetic Algorithm for University Exam Timetabling. In: Burke E.K., Ross P. (eds.): The Practice and Theory of Automated Timetabling I. Lecture Notes in Computer Science 1153. Springer-Verlag: Berlin (1996) 241-250
17. Paechter B., Cumming A., Norman M.G., Luchian H.: Extensions to a Memetic Timetabing System. In: Burke E.K., Ross P. (eds.): The Practice and Theory of Automated Timetabling I. Lecture Notes in Computer Science 1153. Springer-Verlag: Berlin (1996) 251-265
18. Burke E.K., Ross P.: The Practice and Theory of Automated Timetabling: Selected Papers from the 1st International Conference. Springer-Verlag: Berlin. (Lecture Notes in Computer Science 1153). (1996)
19. Burke E.K., Carter M.: The Practice and Theory of Automated Timetabling: Selected Papers from the 2nd International Conference. Springer-Verlag: Berlin. (Lecture Notes in Computer Science 1408). (1998)
20. Burke E.K., Wilhelm E.: Proceedings of the 3rd International Conference on Practice and Theory of Automated Timetabling. To be published by Springer-Verlag: Berlin. (2001)
21. Watson I., Marir F.: Case-Based Reasoning: a Review. The Knowledge Engineering Review. (1994) 9: 327-354
22. Burke E.K., MacCarthy B., Petrovic S., Qu R.: Structured Cases in CBR - Re-using and Adapting Cases for Timetabling Problems. Journal of Knowledge-based System. (2000)13(2-3): 159-165
23. Ricci F., Senter L.: Structured Cases, Trees and Efficient Retrieval. Proceedings of the Fourth European Workshop on Case-based Reasoning. Springer-Verlag: Dublin. (1998) 88-99
24. Sanders K.E., Kettler B.P., Hendler J.A.: The Case for Graph-Structured Representations. Proceedings of the Second International Conference on Case-based Reasoning. SpringerVerlag: Berlin). (1997) 245-254
25. Andersen W.A., Evett M.P., Kettler B., Hendler J.: Massively Parallel Support for Case-Based Planning. IEEE Expert. (1994) 7: 8-14
26. Börner K.: Structural Similarity as Guidance in Case-Based Design. In: Wess S., Althoff K.D., Richter M. (eds): Topics in Case-based Reasoning. Springer-Verlag: Kaiserslautern.(1993) 197-208
27. Börner K., Coulon C.H., Pippig E., Tammer E.C.: Structural Similarity and Adaptation. In: Smith I., Faltings B. (eds): Advances in Case-based Reasoning. Springer-Verlag: Switzerland. (1996) 58-75
28. Gebhardt F.: Methods and Systems for Case Retrieval Exploiting the Case Structure, FABEL-Report 39, GMD, Sankt Augustin. (1995)
29. Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Company: New York. (1979)
30. Messmer B.T.: Efficient Graph Matching Algorithms for Preprocessed Model Graph. PhD thesis, University of Bern. (1995)
31. Quinlan J.R.: Induction of Decision Trees. Machine Learning. Morgan Kaufmann (1986) 1: 81-106
32. Williams H.P.: Model Building in Mathematical Programming. Wiley: Chichester. (1999)
33. Burke E.K., Elliman D.G., Weare R.F.: A University Timetabling System Based on Graph Colouring and Constraint Manipulation. Journal of Research on Computing in Education.(1994) 27: 1-18