Applying a distributed swarm-based algorithm to solve instances of the RCPSP

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper addresses distributed task scheduling problems generalized as a distributed version of the Resource-Constrained Project Scheduling Problem (RCPSP) [1]. We apply and evaluate a novel approach for the RCPSP that is distributed and based on theoretical models of division of labor in social insects. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ferreira, P. R., & Bazzan, A. L. C. (2008). Applying a distributed swarm-based algorithm to solve instances of the RCPSP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5217 LNCS, pp. 399–400). https://doi.org/10.1007/978-3-540-87527-7_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free