Skip to main content
SpringerLink
Log in
Book cover

International Conference on Case-Based Reasoning

ICCBR 2012: Case-Based Reasoning Research and Development pp 122–136Cite as

Case-Based Project Scheduling

  • Conference paper

  • 1436 Accesses

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

Abstract

This paper presents a new approach for solving the Resource-Constrained Project Scheduling Problem using Case-Based Reasoning in a constructive way. Given a project to be scheduled our method retrieves similar projects scheduled in the past, selects the most similar project, and reuses as much as possible from the old solution to build a schedule for the project at hand. The result of this process is a partial schedule that is later extended and revised to produce a complete and valid schedule by a modified version of the Serial Schedule Generation Scheme. We present experimental results showing that our approach works well under reasonable assumptions. Finally, we describe several ways to modify our algorithm in the future so as to obtain even better results.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Herroelen, W., De Reyck, B., Demeulemeester, E.: Resource-constrained project scheduling: a survey of recent developments. Computers and Operations Research 25(4), 279–302 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Brucker, P., Drexl, A., Möhring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research 112(1), 3–41 (1999)

    Article  MATH  Google Scholar 

  3. Blazewicz, J., Lenstra, J., Kan, A.R.: Scheduling subject to resource constraints classification and complexity. Discrete Applied Mathematics 5, 11–24 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kelley, J.: The Critical-Path Method: Resources Planning and Scheduling. In: Industrial Scheduling, pp. 347–365 (1963)

    Google Scholar 

  5. Christofides, N., Alvarez-Valdés, R., Tamarit, J.: Project scheduling with resource constraints: A branch and bound approach. European Journal of Operational Research 29(3), 262–273 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  6. Elmaghraby, S.: Activity networks: Project planning and control by network models. John Wiley & Sons, New York (1977)

    MATH  Google Scholar 

  7. Pinson, E., Prins, C., Rullier, F.: Using tabu search for solving the resource-constrained project scheduling problem. In: Proceedings of the 4th International Workshop on Project Management and Scheduling, pp. 102–106 (1994)

    Google Scholar 

  8. Alvarez-Valdés, R., Tamarit, J.: Heuristic algorithms for resource-constrained project scheduling. In: Advances in Project Scheduling, pp. 113–134. Elsevier (1989)

    Google Scholar 

  9. Kolisch, R., Hartmann, S.: Heuristic Algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis. In: Handbook of Recent Advances in Project Scheduling, pp. 147–178. Kluwer Academic Publishers (1999)

    Google Scholar 

  10. Feng, Y., Goldstone, R.L., Menkov, V.: A graph matching algorithm and its application to conceptual system translation. International Journal on Artificial Intelligence Tools 14, 77–79 (2004)

    Article  Google Scholar 

  11. Patterson, J.H.: A comparison of exact procedures for solving the multiple constrained resource project scheduling problem. Management Science, 854–867 (1984)

    Google Scholar 

  12. Sprecher, A., Drexl, A.: Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. European Journal of Operational Research 107(2), 431–450 (1998)

    Article  MATH  Google Scholar 

  13. Miyashita, K., Sycara, K.P.: Cabins: A framework of knowledge acquisition and iterative revision for schedule improvement and reactive repair. Artificial Intelligence 76(1-2), 377–426 (1995)

    Article  Google Scholar 

  14. Cunningham, P., Smyth, B., Hurley, N.: On the Use of CBR in Optimisation Problems Such as the TSP. In: Aamodt, A., Veloso, M.M. (eds.) ICCBR 1995. LNCS, vol. 1010, pp. 401–410. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  15. Cunningham, P., Smyth, B.: Case-based reasoning in scheduling: Reusing solution components. International Journal of Production Research 35(11), 2947–2962 (1997)

    Article  MATH  Google Scholar 

  16. Scott, S., Simpson, R., Ward, R.: Combining case-based reasoning and constraint logic programming techniques for packaged nurse rostering systems. In: Proceedings of the Third UK Case-Based Reasoning Workshop (1997)

    Google Scholar 

  17. Scott, S., Simpson, R.M.: Case-Bases Incorporating Scheduling Constraint Dimensions - Experiences in Nurse Rostering. In: Smyth, B., Cunningham, P. (eds.) EWCBR 1998. LNCS (LNAI), vol. 1488, pp. 392–401. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  18. Burke, E.K., MacCarthy, B., Petrovica, S., Qu, R.: Structured cases in case-based reasoning: reusing and adapting cases for time-tabling problems. Knowledge-Based Systems 13(2-3), 159–165 (2000)

    Article  Google Scholar 

  19. Burke, E.K., MacCarthy, B.L., Petrovic, S., Qu, R.: Case-Based Reasoning in Course Timetabling: An Attribute Graph Approach. In: Aha, D.W., Watson, I. (eds.) ICCBR 2001. LNCS (LNAI), vol. 2080, pp. 90–104. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  20. Burke, E., MacCarthy, B., Petrovic, S., Qu, R.: Multiple-retrieval case-based reasoning for course timetabling problems. Journal of the Operational Research Society 57(2), 148–162 (2006)

    MATH  Google Scholar 

  21. Beddoe, G., Petrovic, S.: A novel approach to finding feasible solutions to personnel rostering problems. In: Proceedings of the 14th Annual Conference of the Production and Operations Management Society (April 2003)

    Google Scholar 

  22. Petrovic, S., Beddoe, G., Vanden Berghe, G.: Storing and Adapting Repair Experiences in Employee Rostering. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 148–165. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  23. Beddoe, G., Petrovic, S.: Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering. European Journal of Operational Research 175(2), 649–671 (2006)

    Article  MATH  Google Scholar 

  24. Beddoe, G., Petrovic, S.: Enhancing case-based reasoning for personnel rostering with selected tabu search concepts. Journal of the Operational Research Society 58(12), 1586–1598 (2007)

    Article  Google Scholar 

  25. Beddoe, G., Petrovic, S., Li, J.: A hybrid metaheuristic case-based reasoning system for nurse rostering. Journal of Scheduling, 99–119 (2008)

    Google Scholar 

  26. Burke, E.K., Petrovic, S., Qu, R.: Case-based heuristic selection for timetabling problems. Journal of Scheduling 9(2), 115–132 (2006)

    Article  MATH  Google Scholar 

  27. Petrovic, S., Yang, Y., Dror, M.: Case-based selection of initialisation heuristics for metaheuristic examination timetabling. Expert Systems with Applications 33(3), 772–785 (2007)

    Article  Google Scholar 

  28. Kolisch, R.: Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research 90(2), 320–333 (1996)

    Article  MATH  Google Scholar 

  29. Sprecher, A., Kolisch, R., Drexl, A.: Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. European Journal of Operational Research 80(1), 94–102 (1995)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IIIA - Artificial Intelligence Research Institute, CSIC - Spanish National Research Council, Campus U.A.B., 08193, Bellaterra, Catalonia, Spain

    Mario Gómez & Enric Plaza

Authors
  1. Mario Gómez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Enric Plaza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universidad Complutense de Madrid, 28040, Madrid, Spain

    Belén Díaz Agudo

  2. Department of Computer Science, University of Auckland, 1142, Auckland, New Zealand

    Ian Watson

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gómez, M., Plaza, E. (2012). Case-Based Project Scheduling. In: Agudo, B.D., Watson, I. (eds) Case-Based Reasoning Research and Development. ICCBR 2012. Lecture Notes in Computer Science(), vol 7466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32986-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32986-9_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32985-2

  • Online ISBN: 978-3-642-32986-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation