Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources (Q278540)
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: Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources |
scientific article; zbMATH DE number 6576132
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources |
scientific article; zbMATH DE number 6576132 |
Statements
Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources (English)
0 references
2 May 2016
0 references
project scheduling
0 references
nonaccumulative resources
0 references
dynamic programming
0 references
polynomial solvability
0 references
pseudo-polynomial solvability
0 references
0 references
0 references
0 references
0.87111723
0 references
0.86136794
0 references
0.86051625
0 references
0.8571843
0 references
0.8556917
0 references
0.8517687
0 references
0.84573376
0 references
0.8438028
0 references
