Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation (Q336432)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation |
scientific article; zbMATH DE number 6650447
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation |
scientific article; zbMATH DE number 6650447 |
Statements
Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation (English)
0 references
10 November 2016
0 references
resource-constrained project scheduling problem
0 references
facility layout problem
0 references
artificial bee colony optimization
0 references
permutation representation scheme
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8057067394256592
0 references
0.799464225769043
0 references
0.789567768573761
0 references
0.7842538952827454
0 references
