.png){kind=icon}
Return
An evolutionary algorithm for resource-constrained project scheduling
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2002.804914.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The single-mode, single-project, resource-constrained project-scheduling problem is solved by an evolutionary algorithm. The design of this algorithm is presented. Results of a computational study on two sets of benchmark problems, the first consisting of 330 problem instances and the second 2040, are presented. These results show that the proposed algorithm is effective in terms of the number of times it achieves both the best-known solutions and the average error with respect to these solutions, particularly given that the best-known solutions have been compiled from various sources, using a variety of algorithms. Moreover, the computation time requirements are quite modest.
Keywords:
evolutionary computation
resource-constrained scheduling
scheduling
Journal
IF:
12
Papers:
1.9K
Citations:
2.4W
Organization
No organization information available
Cited Papers
ShareSaveCloning, Sequence Alignment and Functional Analysis of AFS Gene Promoter in Apple and Pear Fruits.png)
IF0
PREAI
ShareSave
View more