Abstract
In this paper an A-Team architecture for solving the multi-mode resource-constrained project scheduling problem with minimal and maximal time lags (MRCPSP/max) is proposed and experimentally validated. To solve this problem an asynchronous team of agents implemented using JABAT middleware has been proposed. Four kinds of optimization agent has been used. Each of them acts in two ways depending whether the received initial solution is feasible or not. The paper contains the MRCPSP/max problem formulation, description of the proposed architecture for solving the problem instances, description of optimization algorithms, description of the experiment and the discussion of the computational experiment results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.) Intelligent Agents in the Evolution of Web and Applications, pp. 57–86. Springer, Heidelberg (2009)
Bartusch, M., Mohring, R.H., Radermacher, F.J.: Scheduling Project Networks with Resource Constraints and Time Windows. Annual Operational Research 16, 201–240 (1988)
Barrios, A., Ballestin, F., Valls, V.: A double genetic algorithm for the MRCPSP/max. Computers and Operations Research 38, 33–43 (2011)
Heilmann, R.: Resource-Constrained Project Scheduling: a Heuristic for the Multi-Mode Case. OR Spektrum 23, 335–357 (2001)
Heilmann, R.: A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags. European Journal of Operational Research 144, 348–365 (2003)
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. LNCS, vol. 3993, pp. 719–726. Springer, Heidelberg (2006)
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)
Jȩdrzejowicz, P., Ratajczak-Ropel, E.: A-Team for Solving MRCPSP/max Problem. Accepted for publication in LNCS/LNAI series (2011)
Neumann, K., Schwindt, C., Zimmermann, J.: Project Scheduling with Time Windows and Scarce Resources, 2nd edn. Springer, Heidelberg (2003)
Nonobe, K., Ibaraki, T.: A Tabu Search Algorithm for a Generalized Resource Constrained Project Scheduling Problem. In: MIC 2003: The Fifth Metaheuristics International Conference, pp. 55-1–55-6 (2003)
PSPLIB, http://129.187.106.231/psplib
Reyck, B., Herroelen, W.: The Multi-Mode Resource-Constrained Project Scheduling Problem with Generalized Precedence Relations. European Journal of Operational Research 119, 538–556 (1999)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jȩdrzejowicz, P., Ratajczak-Ropel, E. (2011). Double-Action Agents Solving the MRCPSP/Max Problem. In: Jędrzejowicz, P., Nguyen, N.T., Hoang, K. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2011. Lecture Notes in Computer Science(), vol 6923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23938-0_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-23938-0_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23937-3
Online ISBN: 978-3-642-23938-0
eBook Packages: Computer ScienceComputer Science (R0)