Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources (Q278540): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B36 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65Y20 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6576132 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
project scheduling | |||
| Property / zbMATH Keywords: project scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
nonaccumulative resources | |||
| Property / zbMATH Keywords: nonaccumulative resources / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
dynamic programming | |||
| Property / zbMATH Keywords: dynamic programming / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
polynomial solvability | |||
| Property / zbMATH Keywords: polynomial solvability / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
pseudo-polynomial solvability | |||
| Property / zbMATH Keywords: pseudo-polynomial solvability / rank | |||
Normal rank | |||
Revision as of 18:02, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources |
scientific article |
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
