An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem (Q1711441)
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: An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem |
scientific article; zbMATH DE number 7003091
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem |
scientific article; zbMATH DE number 7003091 |
Statements
An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem (English)
0 references
18 January 2019
0 references
project scheduling
0 references
scheduling
0 references
RCPSP
0 references
lower bounds
0 references
pseudo-polynomial algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8682898283004761
0 references
0.8579203486442566
0 references
0.8391549587249756
0 references
