Abstract
In this paper the agent system based on A-Team and E-JABAT architecture for solving the resource availability cost problem (RACP) is proposed and experimentally tested. RACP known also as RIP (resource investment problem) belongs to the NP-hard problem class. To solve this problem an A-Team consisting of an asynchronous agents implemented using E-JABAT middleware have been proposed. Three kinds of optimization agent have been used. Computational experiment involves evaluation of the proposed approach.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Artigues, C., Demassey, S., Néron, E.: Resource-Constrained Project Scheduling. Models, Algorithms, Extensions and Applications. ISTE Ltd. and John Wiley & Sons, Inc. (2008)
Barbucha, D., Czarnowski, I., Jędrzejowicz, P., Ratajczak-Ropel, E., Wierzbowska, I.: e-JABAT - An Implementation of the Web-Based A-Team. In: Nguyen, N.T., Jain, L.C. (eds.) Intel. Agents in the Evol. of Web & Appl. SCI, vol. 167, pp. 57–86. Springer, Heidelberg (2009)
Barbucha, D., Czarnowski, I., Jędrzejowicz, P., Ratajczak-Ropel, E., Wierzbowska, I.: Parallel Cooperating A-Teams. In: Jędrzejowicz, P., Nguyen, N.T., Hoang, K. (eds.) ICCCI 2011, Part II. LNCS (LNAI), vol. 6923, pp. 322–331. Springer, Heidelberg (2011)
Błażewicz, J., Lenstra, J., Rinnooy, A.: Scheduling subject to resource constraints: Classification and complexity. Discrete Applied Mathematics 5, 11–24 (1983)
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, 3–41 (1999)
Cherkassky, B.V., Goldberg, A.V.: On Implementing Push-Relabel Method for the Maximum Flow Problem. In: Balas, E., Clausen, J. (eds.) IPCO 1995. LNCS, vol. 920, pp. 157–171. Springer, Heidelberg (1995)
Demeulemeester, E.L.: Optimal Algorithms for Various Classes of Multiple Resource-Constrained Project Scheduling Problems, Ph.D. thesis, Department of Applied Economics, Katholieke Universiteit Leuven, Belgium (1992)
Demeulemeester, E.L., Herroelen, W.S.: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem. Management Science 38, 1803–1818 (1992)
Demeulemeester, E.L.: Minimizing resource availability costs in time-limited project networks. Management Science 41, 1590–1598 (1995)
Drexl, A., Kimms, A.: Optimization guided lower and upper bounds for the resource investment problem. Journal of the Operational Research Society 52, 340–351 (2001)
Herroelen, W., De Reyck, B., Demeulemeester, E.L.: A classification scheme for project scheduling. In: Węglarz, J. (ed.) Handbook of Recent Advances in Project Scheduling, pp. 1–26. Kluwer, Dordrecht (1999)
Jędrzejowicz, 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, Part III. LNCS, vol. 3993, pp. 719–726. Springer, Heidelberg (2006)
Jędrzejowicz, P., Ratajczak-Ropel, E.: New Generation A-Team for Solving the Resource Constrained Project Scheduling. In: Proc. the Eleventh International Workshop on Project Management and Scheduling, Istanbul, pp. 156–159 (2008)
Jedrzejowicz, P., Ratajczak-Ropel, E.: 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.) KES-AMSTA 2009. LNCS (LNAI), vol. 5559, pp. 734–743. Springer, Heidelberg (2009)
Kolisch, R., Sprecher, A., Drexl, A.: Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science 41, 1693–1703 (1995)
Kolisch, R.: Serial and parallel Resource-Constrained Project Scheduling Methods Revisited: Theory and Computation. European Journal of Operational Research 43, 23–40 (1996)
Möhring, R.: Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time. Operations Research 32, 89–120 (1984)
Möhring, R.H., Schulz, A.S., Stork, F., Uetz, M.: Solving project scheduling problems by minimum cut computations. Management Science 49, 330–350 (2003)
PSPLIB, http://129.187.106.231/psplib
Radermacher, F.J.: Scheduling of Project Networks. Annals of Operations Research 4, 227–252 (1985)
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)
Rodrigues, S., Yamashita, D.: An exact algorithm for minimizing resource availability costs in project scheduling. European Journal of Operational Research 206, 562–568 (2010)
Shadrokh, S., Kianfar, F.: A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty. European Journal of Operational Research 181, 86–101 (2007)
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)
Van Peteghem, V., Vanhoucke, M.: An artificial immune system algorithm for the resource availability cost problem. Flexible Services and Manufacturing Journal, 1936-6582, 1–23 (2011)
Yamashita, D., Armentano, V., Laguna, M.: Scatter search for project scheduling with resource availability cost. European Journal of Operational Research 169, 623–637 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jędrzejowicz, P., Ratajczak-Ropel, E. (2012). A-Team for Solving the Resource Availability Cost Problem. In: Nguyen, NT., Hoang, K., Jȩdrzejowicz, P. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2012. Lecture Notes in Computer Science(), vol 7654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34707-8_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-34707-8_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34706-1
Online ISBN: 978-3-642-34707-8
eBook Packages: Computer ScienceComputer Science (R0)