A preemptive bound for the resource constrained project scheduling problem (Q398922)
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: A preemptive bound for the resource constrained project scheduling problem |
scientific article; zbMATH DE number 6331204
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A preemptive bound for the resource constrained project scheduling problem |
scientific article; zbMATH DE number 6331204 |
Statements
A preemptive bound for the resource constrained project scheduling problem (English)
0 references
18 August 2014
0 references
resource constrained project scheduling problem
0 references
destructive lower bounds
0 references
preemptive relaxation
0 references
linear programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8792575001716614
0 references
0.878507137298584
0 references
0.878507137298584
0 references
0.8591966032981873
0 references
0.8523769974708557
0 references
