Solving the RCPSP/max Problem by the Team of Agents

摘要

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.