Skip to main content
SpringerLink
Log in

Integrating CBR and Heuristic Search for Learning and Reusing Solutions in Real-time Task Scheduling

  • Conference paper
  • First Online:
Case-Based Reasoning Research and Development (ICCBR 1999)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1650))

Included in the following conference series:

Abstract

This paper presents the Case-Based Reasoning Real-Time Scheduling System (CBR-RTS) that integrates into a case-based reasoning framework a heuristic search component. The problem addressed involves scheduling sets of tasks with precedence, ready time and deadline constraints. CBR-RTS reuses the solution of known cases to simplify and solve new problems. When the system does not have applicable cases, it tries to find a solution using heuristic search. A particularly interesting feature of CBR-RTS is its learning ability. New problems solved by the heuristic scheduler can be added to the case base for future reuse. Performed tests have shown that small bases of cases carefully chosen allow to substantially reduce the time needed to solve new complex problems

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Stankovic, J. A. Misconceptions About Real-Time Computing. IEEE Computer, October, 1988.

    Google Scholar 

  2. Liu, C.L., J.W. Layland. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. JACM, vol. 20. no.1, 1973.

    Google Scholar 

  3. Blazewicz, J., J.K. Lenstra and A.H.G.R. Kan. Scheduling Subject to Resource Constraints: Classification and Complexity. Discrete Applied Mathematics 5:11–24, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  4. Adán Coello, J.M., M.F. Magalhães, K. Ramamritham. Developing predictable and flexible real-time systems. Control Engineering Practice. 6(1):67–81. 1998.

    Article  Google Scholar 

  5. Kolodner, J. Case-Based Reasoning. Morgan Kaufmann, 1993.

    Google Scholar 

  6. Mok, A.K. Fundamental Desing Problems of Distributed Systems for the Distributed Hard-Real-Time Environment. PhD Thesis, Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. 1983.

    Google Scholar 

  7. Sprunt, B., L. Sha and J. Lehoczky. Aperiodic Task Scheuling for Hard-Real-Time Systems. The Journal of Real-Time Systems 1, 27–60. 1989.

    Article  Google Scholar 

  8. Messmer, B.T. Efficient Graph Matching algorithms for Preprocessed Model Graphs. PhD Thesis. Institute of Computer Science and Applied Mathematics, University of Bern, Switzerland, 1996.

    Google Scholar 

  9. Ullman, J. R. An algorithm for subgraph isomorphism. Journal of the ACM, 23(1):31–42, 1976.

    Article  MATH  Google Scholar 

  10. Ramamritham, K., G. Fohler, J.M. Adán. Issues in the static allocation and scheduling of complex periodic tasks. In: Proc. 10th IEEE Workshop on Real-Time Operating Systems and Software. 1993.

    Google Scholar 

  11. Xu, J. and D.L. Parnas. Scheduling processes with release times, deadlines, precedence, and exclusion relations. IEEE Transactions on Software Engineering, 16(3):360–369. 1990.

    Article  Google Scholar 

  12. Miyashita, K. and K. Sycara. CABINS: A framework of Knowledge Acquisition and Iterative Revision for Schedule Improvement and Reactive Repair. CMU Technical Report CMU-RI-TR-94-34. The Robotics Institute, Carnegie Mellon University, USA, 1995.

    Google Scholar 

  13. Koton, P. Reasoning about evidence in causal explanation. In Proceedings of AAAI-88. AAAI Press/MIT Press. Cambridge, MA, 1988.

    Google Scholar 

  14. Cunningham, P. and B. Smyth. Case-Based Reasoning in Scheduling: Reusing Solution Components. Technical Report TCD-CS-96-12, Department of Computer Science, Trinity College Dublin, Ireland. 1996.

    Google Scholar 

  15. Veloso, M. PRODIGY/ANALOGY: Analogical Reasoning in General Problem Solving. In Topics in Case-Based Reasoning, S. Wess, K. Althoff and M. Richter (Eds.) Lecture Notes in Artificial Intelligence, Springer-Verlag, 1994.

    Google Scholar 

  16. Bunke, H. and B.T. Messmer Similarity Measures for Structured Representations. In Topics in Case-Based Reasoning, S. Wess, K. Althoff and M. Richter (Eds.) Lecture Notes in Artificial Intelligence, Springer-Verlag. 1994.

    Google Scholar 

  17. Gebhardt, F. Methods and systems for case retrieval exploiting the case structure. FABEL report no. 39. GMD, Germany. 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto de Informática, PUC-Campinas, Cx.P. 317, CEP 13.020-904, Campinas SP, BRAZIL

    Juan Manuel Adán Coello

  2. FEEC/UNICAMP, Campinas SP, BRAZIL

    Ronaldo Camilo dos Santos

Authors
  1. Juan Manuel Adán Coello
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ronaldo Camilo dos Santos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fraunhofer Institute for Experimental Software Engineering (IESE), Sauerwiesen 6, D 67661, Kaiserslautern, Germany

    Klaus-Dieter Althoff

  2. Department of Computer Science, University of Kaiserslautern, P.O. Box 3049, D 67653, Kaiserslautern, Germany

    Ralph Bergmann

  3. Department of Computer Science, University of Wyoming, P.O. Box 3682, Laramie, WY, 82072, USA

    L.Karl Branting

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Adán Coello, J.M., Camilo dos Santos, R. (1999). Integrating CBR and Heuristic Search for Learning and Reusing Solutions in Real-time Task Scheduling. In: Althoff, KD., Bergmann, R., Branting, L. (eds) Case-Based Reasoning Research and Development. ICCBR 1999. Lecture Notes in Computer Science, vol 1650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48508-2_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-48508-2_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66237-2

  • Online ISBN: 978-3-540-48508-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation