LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Burke, Edmund; MacCarthy, Bart L.; Petrovic, Sanja; Qu, Rong (2001)
Languages: English
Types: Unknown
Subjects:

Classified by OpenAIRE into

ACM Ref: MathematicsofComputing_DISCRETEMATHEMATICS
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. Previous solved cases represented by attribute graphs were organized hierarchically into a decision tree. The retrieval searches for graph isomorphism among these attribute graphs. In this paper, the approach is further developed to solve a wider range of problems. We also attempt to retrieve those graphs that have common similar structures but also have 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 system 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.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • 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
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article