The multiple resource constrained project scheduling problem: A breadth-first approach (Q1806916)
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 1358473
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The multiple resource constrained project scheduling problem: A breadth-first approach |
scientific article; zbMATH DE number 1358473 |
Statements
The multiple resource constrained project scheduling problem: A breadth-first approach (English)
0 references
8 November 1999
0 references
project scheduling
0 references
resource constraint
0 references
breadth-first search
0 references
best-first search
0 references
breadth-first tree search scheme
0 references
makespan
0 references
0 references
0 references
0.8487045764923096
0 references
0.8323667645454407
0 references
0.8303418159484863
0 references
