Skip to main content

Experimental Evaluation of A-Teams Solving Resource Availability Cost Problem

  • Conference paper
  • First Online:
Intelligent Decision Technologies 2019

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 142))

Abstract

In this paper, a multi-agent system (MAS) based on the Asynchronous Team (A-Team) concept employs different cooperation strategies to solving the resource availability cost problem (RACP). The strategies proposed are experimentally validated. The RACP, known also as the resource investment problem (RIP), belongs to the class of NP-hard optimization problems. To solve the problem, the A-Team-based system which uses asynchronous agents implemented in the JADE-based A-Team (JABAT) environment has been proposed. Four strategies and four kinds of optimization agents are used. In this paper, one static and three dynamic strategies are used to manage the A-Team. The approach is validated experimentally using 144 problem instances.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Similar content being viewed by others

References

  1. Artigues, C., Demassey, S., Néron, E.: Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications. ISTE Ltd and John Wiley & Sons (2008)

    Google Scholar 

  2. Barbucha, D., Czarnowski, I., Jȩdrzejowicz, P., Ratajczak-Ropel, E., Wierzbowska, I.: E-JABAT - An Implementation of the Web-Based A-Team. In: Ngoc Thanh Nguyen, Lakhmi C. Jain (eds.) Intelligent Agents in the Evolution of Web and Applications, pp. 57–86. Springer, Heidelberg (2009)

    Google Scholar 

  3. Barbucha, D., Czarnowski, I., Jȩdrzejowicz, P., Ratajczak-Ropel, E., Wierzbowska, I.: Parallel Cooperating A-Teams. In: Jȩdrzejowicz, P., et al. (eds.) Computational Collective Intelligence. Technologies and Applications, LNAI, vol. 6923, pp. 322–331. Springer, Heidelberg (2011)

    Google Scholar 

  4. Błażewicz, J., Lenstra, J., Rinnooy, A.: Scheduling subject to resource constraints: classification and complexity. Discret. Appl. Math. 5, 11–24 (1983)

    Article  MathSciNet  Google Scholar 

  5. Brucker, P., Drexl, A., Möhring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: notation, classification, models, and methods. Eur. J. Oper. Res. 112, 3–41 (1999)

    Article  Google Scholar 

  6. Cherkassky, B.V., Goldberg, A.V.: On implementing push-relabel method for the maximum flow problem. In: Balas, E., Clausen, J. (eds.) Proceedings of the 4th Conference on Integer Programming and Combinatorial Optimization. LNCS, vol. 920, pp. 157–171 Springer, Berlin (1995)

    Chapter  Google Scholar 

  7. Demeulemeester, E.L.: Optimal Algorithms for Various Classes of Multiple Resource-Constrained Project Scheduling Problems. Katholieke Universiteit Leuven, Belgium, Department of Applied Economics (1992). Ph.D. thesis

    Google Scholar 

  8. Demeulemeester, E.L., Herroelen, W.S.: A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Manag. Sci. 38, 1803–1818 (1992)

    Article  Google Scholar 

  9. Demeulemeester, E.: Minimizing resource availability costs in time-limited project networks. Manag. Sci. 41, 1590–1598 (1995)

    Article  Google Scholar 

  10. Drexl, A., Kimms, A.: Optimization guided lower and upper bounds for the resource investment problem. J. Oper. Res. Soc. 52, 340–351 (2001)

    Article  Google Scholar 

  11. Herroelen, W., De Reyck, B., Demeulemeester, E.: A classification scheme for project scheduling. In: Wȩglarz, J. (ed.) Handbook of Recent Advances in Project Scheduling, pp. 1–26. Kluwer, Dordrecht (1999)

    Google Scholar 

  12. Jȩdrzejowicz, P.: Social learning algorithm as a tool for solving some difficult scheduling problems. Found. Comput. Decis. Sci. 24, 51–66 (1999)

    MathSciNet  MATH  Google Scholar 

  13. Jȩdrzejowicz, P., Wierzbowska I.: JADE-Based A-Team Environment. ICCS 2006. LNCS, vol. 3993, pp. 719–726. Springer (2006)

    Google Scholar 

  14. Jȩdrzejowicz, P., Ratajczak-Ropel, E.: New Generation A-Team for Solving the Resource Constrained Project Scheduling, pp. 156–159. Proceeding of the Eleventh International Workshop on Project Management and Scheduling, Istanbul (2008)

    Google Scholar 

  15. Jȩdrzejowicz, P., Ratajczak-Ropel, E.: A-Team for solving the resource availability cost problem. In: Nguyen, N.T., Hoang, K., Jȩdrzejowicz, P. (eds.) Computational Collective Intelligence Technologies and Applications. Lecture Notes in Artificial Intelligence, vol. 7654, pp. 443–452 (2012)

    Chapter  Google Scholar 

  16. Kölisch, R., Sprecher, A., Drexl, A.: Characterization and generation of a general class of resource-constrained project scheduling problems. Manag. Sci. 41, 1693–1703 (1995)

    Article  Google Scholar 

  17. Möhring, R.: Minimizing costs of resource requirements in project networks subject to a fixed completion time. Oper. Res. 32, 89–120 (1984)

    Article  Google Scholar 

  18. Möhring, R.H., Schulz, A.S., Stork, F., Uetz, M.: Solving project scheduling problems by minimum cut computations. Manag. Sci. 49, 330–350 (2003)

    Article  Google Scholar 

  19. PSPLIB - Project Scheduling Problems Library. http://129.187.106.231/psplib

  20. Rangaswamy, B.: Multiple Resource Planning and Allocation in Resource-Constrained Project Networks. University of Colorado, Colorado (1998)

    Google Scholar 

  21. Ranjbar, M., Kianfar, F., Shadrokh, S.: Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm. Appl. Math. Comput. 196, 879–888 (2008)

    MathSciNet  MATH  Google Scholar 

  22. Ratajczak-Ropel, E.: Agent-based approach to the single and multi-mode resource-constrained project scheduling. Population-Based Approaches to the Resource-Constrained and Discrete-Continuous Scheduling. In: Kacprzyk J. (ed.) Studies in Systems Decision and Control, Vol. 108, Springer International Publishing, pp. 1–100 (2018)

    Google Scholar 

  23. Rodrigues, S., Yamashita, D.: An exact algorithm for minimizing resource availability costs in project scheduling. Eur. J. Oper. Res. 206, 562–568 (2010)

    Article  MathSciNet  Google Scholar 

  24. Rodrigues, S., Yamashita, D.: Exact methods for the resource availability cost problem. In: C. Schwindt, Zimmermann, J. (eds.) Handbook on project management and scheduling: vol. 1, pp. 319–338. Springer International Publishing (2015)

    Google Scholar 

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

    Google Scholar 

  26. Tormos, P., Lova, A.: An efficient multi-pass heuristic for project scheduling with constrained resources. Int. J. Prod. Res. 41(5), 1071–1086 (2003)

    Article  Google Scholar 

  27. Van Peteghem, V., Vanhoucke, M.: An artificial immune system algorithm for the resource availability cost problem. Flex. Serv. Manuf. J. 1936–6582, 1–23 (2011)

    Google Scholar 

  28. Van Petegham, V., Vanhoucke, M.: An artificial immune system algorithm for the resource availability cost problem. Flex. Serv. Manuf. J. 25(1), 122–144 (2013)

    Article  Google Scholar 

  29. Yamashita, D., Armentano, V., Laguna, M.: Scatter search for project scheduling with resource availability cost. Eur. J. Oper. Res. 169, 623–637 (2006)

    Article  MathSciNet  Google Scholar 

  30. Zhu, X., Ruiz, R., Li, S.: An effective heuristic for project scheduling with resource availability cost. Eur. J. Oper. Res. 257, 746–762 (2017)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ewa Ratajczak-Ropel .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jedrzejowicz, P., Ratajczak-Ropel, E. (2020). Experimental Evaluation of A-Teams Solving Resource Availability Cost Problem. In: Czarnowski, I., Howlett, R., Jain, L. (eds) Intelligent Decision Technologies 2019. Smart Innovation, Systems and Technologies, vol 142. Springer, Singapore. https://doi.org/10.1007/978-981-13-8311-3_19

Download citation

Publish with us

Policies and ethics