2008
DOI: 10.1016/j.infsof.2008.03.002
|View full text |Cite
|
Sign up to set email alerts
|

Time-line based model for software project scheduling with genetic algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
76
0
2

Year Published

2011
2011
2021
2021

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 96 publications
(78 citation statements)
references
References 24 publications
0
76
0
2
Order By: Relevance
“…By law, ACO algorithms may be useful to any combinational executing problems by significant -solution components" that the ants utilized to iterative developed contender result and on which they can put down pheromone [11]. [20], [21]. It is a meta heuristic motivated by the scrounging activities of ants in the wild, and in addition, the marvels known as stigmergy, term utilized by Grasse in 1959.…”
Section: Ant Colony Optimizationmentioning
confidence: 99%
“…By law, ACO algorithms may be useful to any combinational executing problems by significant -solution components" that the ants utilized to iterative developed contender result and on which they can put down pheromone [11]. [20], [21]. It is a meta heuristic motivated by the scrounging activities of ants in the wild, and in addition, the marvels known as stigmergy, term utilized by Grasse in 1959.…”
Section: Ant Colony Optimizationmentioning
confidence: 99%
“…Para (Schwaber, 2002;Chang et al, 2008), principalmente no que se refere à administração de recursos (Plekhanova, 1998 Kelley (1963), Wiest (1966), Kurtulus e Narula (1985) e Mohanty e Siddiq (1989). Porém é Ichihara (2002) que associa os problemas do programa de múltiplos projetos com as limitações de recursos estão relacionadas ao RCPSP.…”
Section: Resource-constrained Project Scheduling Problemunclassified
“…We use an acyclic directed graph defined as PG (Precedence Graph) to represent their precedence [6,7]. The PG is denoted as G=(V, E), where V is the set of tasks, E is a set of edges and represent the precedence relation, an edge(tsk i ,tsk j )∈E, that is tsk i is a predecessor of tsk j task.…”
Section: Spsp Modelmentioning
confidence: 99%