Skip to main content

Solving the RCPSP/max Problem by the Team of Agents

  • Conference paper
Book cover Agent and Multi-Agent Systems: Technologies and Applications (KES-AMSTA 2009)

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

Abstract

The paper proposes an agent-based approach to solving instances of the resource constrained project scheduling problem with minimal and maximal time lags (time windows). Since the problem is known to be NP-hard, the proposed solution takes advantage of the parallel and distributed computations abilities of the E-JABAT which is a middleware supporting the construction of the dedicated A-Team architectures based on the population-based approach. In this paper the E-JABAT-based A-Team architecture dedicated for solving the RCPSP/max problem instances is proposed and experimentally validated. The paper contains the RCPSP/max problem formulation, overview of the E-JABAT environment, a detailed description of the E-JABAT architecture implemented for solving the RCPSP/max problem instances and a discussion of the computational experiment results.

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

Access this chapter

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. Bartusch, M., Mohring, R.H., Radermacher, F.J.: Scheduling project networks with resource constraints and time windows. Annual Operational Research 16, 201–240 (1988)

    MathSciNet  MATH  Google Scholar 

  2. Barbucha, D., Czarnowski, I., Jedrzejowicz, P., Ratajczak, E., Wierzbowska, I.: JADE-Based A-Team as a Tool for Implementing Population-Based Algorithms. In: Proc. VI Int. Conf. on Intelligent Systems Design and Applications, vol. 3. IEEE Computer Society, Los Alamitos (2006)

    Google Scholar 

  3. Barbucha, D., Czarnowski, I., Jedrzejowicz, P., Ratajczak-Ropel, E., Wierzbowska, I.: E-JABAT – An Implementation of the Web-Based A-Team. In: Intelligent Agents in the Evolution of Web and Applications. Studies in Computational Intelligence, vol. 167, pp. 57–86. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Blazewicz, J., Lenstra, J., Rinnooy, A.: Scheduling subject to resource constraints: Classification and complexity. Discrete Applied Mathematics 5, 11–24 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cesta, A., Oddi, A., Smith, S.F.: A Constraint-Based Method for Project Scheduling with Time Windows. Journal of Heuristics 8, 108–136 (2002)

    Article  MATH  Google Scholar 

  6. Ferreira, C.: Gene Expression Programming: Mathematical Modeling by an Artificial Intelligence, on-line book (2002), http://www.gene-expression-programming.com/GepBook/Introduction.htm

  7. Ferreira, C.: Gene Expression Programming: Mathematical Modeling by an Artificial Intelligence, 2nd edn. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  8. Jedrzejowicz, P., Wierzbowska, I.: JADE-Based A-Team Environment. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol. 3993, pp. 719–726. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Jedrzejowicz, P., Ratajczak, E.: Agent-Based Approach to Solving the Resource Constrained Project Scheduling Problem. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds.) ICANNGA 2007. LNCS, vol. 4431, pp. 480–487. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Neumann, K., Schwindt, C., Zimmermann, J.: Project Scheduling with Time Windows and Scarce Resources. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  11. Neumann, K., Schwindt, C., Zimmermann, J.: Resource-Constrained project Scheduling with Time Windows, Recent developments and new applications. In: Perspectives in Modern Project Scheduling, pp. 375–407. Springer, Heidelberg (2006)

    Google Scholar 

  12. PSPLIB, http://129.187.106.231/psplib

  13. Talukdar, S., Baerentzen, L., Gove, A., de Souza, P.: Asynchronous Teams: Co-operation Schemes for Autonomous, Computer-Based Agents, Technical Report EDRC 18-59-96, Carnegie Mellon University, Pittsburgh (1996)

    Google Scholar 

  14. Valls, V., Ballestin, F., Barrios, A.: An evolutionary algorithm for the resource-constrained project scheduling problem subject to temporal constraints. In: Proc. of PMS 2006, Tenth International Workshop on Project Management and Scheduling, Nakom, Poznan, pp. 363–369 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jedrzejowicz, P., Ratajczak-Ropel, E. (2009). Solving the RCPSP/max Problem by the Team of Agents. In: Håkansson, A., Nguyen, N.T., Hartung, R.L., Howlett, R.J., Jain, L.C. (eds) Agent and Multi-Agent Systems: Technologies and Applications. KES-AMSTA 2009. Lecture Notes in Computer Science(), vol 5559. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01665-3_74

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01665-3_74

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01664-6

  • Online ISBN: 978-3-642-01665-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics