The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure (Q1296080)
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: The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure |
scientific article; zbMATH DE number 1314770
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure |
scientific article; zbMATH DE number 1314770 |
Statements
The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure (English)
0 references
13 September 2000
0 references
resource constrained project scheduling
0 references
crashable modes
0 references
activity cost
0 references
project cost
0 references
penalty cost
0 references
0 references
0 references
0 references
0 references
0.9110324382781982
0 references
0.8660801649093628
0 references
0.858588457107544
0 references
0.8236169219017029
0 references
