Complexity of some project scheduling problem with nonrenewable resources (Q2885271)
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: Complexity of some project scheduling problem with nonrenewable resources |
scientific article; zbMATH DE number 6037326
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of some project scheduling problem with nonrenewable resources |
scientific article; zbMATH DE number 6037326 |
Statements
21 May 2012
0 references
pseudopolynomial algorithm
0 references
deterministic project scheduling
0 references
Complexity of some project scheduling problem with nonrenewable resources (English)
0 references
0.8978661298751831
0 references
0.8208813071250916
0 references
0.807294487953186
0 references
0.7998769283294678
0 references
0.7983949780464172
0 references
