A-Team for solving MRCPSP/max problem

Authors:
Piotr Jędrzejowicz;Ewa Ratajczak-Ropel
Affiliations:
Department of Information Systems, Gdynia Maritime University, Gdynia, Poland;Department of Information Systems, Gdynia Maritime University, Gdynia, Poland
Venue:
KES-AMSTA'11 Proceedings of the 5th KES international conference on Agent and multi-agent systems: technologies and applications
Year:
2011

Citing 4
Cited 1

Scheduling project networks with resource constraints and time windows

Annals of Operations Research
Solving the RCPSP/max Problem by the Team of Agents

KES-AMSTA '09 Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
A double genetic algorithm for the MRCPSP/max

Computers and Operations Research
JADE-Based a-team environment

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III

Double-action agents solving the MRCPSP/Max problem

ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the E-JABAT-based A-Team architecture for solving multi-mode resource-constrained project scheduling problem with minimal and maximal time lags (MRCPSP/max) is proposed and experimentally validated. MRCPSP/max, also known as MRCPSP-GPR (MRCPSP with generalised precedence relations), belongs to the NP-hard problem class. To solve this problem an asynchronous team of agents implemented using JABAT middleware has been proposed. Three kinds of optimization agent has been used. Computational experiment involves evaluation of optimization agent performance within the A-Team. The paper contains the MRCPSP/max problem formulation, description of the proposed architecture for solving the problem instances, description of optimization algorithms and the discussion of the computational experiment results.