Scheduling resource-constrained projects competitively at modest memory requirements (Q3116759)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6005888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling resource-constrained projects competitively at modest memory requirements |
scientific article; zbMATH DE number 6005888 |
Statements
Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements (English)
0 references
12 February 2012
0 references
project scheduling
0 references
resource constraints
0 references
single-mode
0 references
branch-and-bound
0 references
0.8745579123497009
0 references
0.8696953058242798
0 references
0.8520035743713379
0 references
0.8493132591247559
0 references
