Approximability results for the resource-constrained project scheduling problem with a single type of resources (Q744638)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6347868
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximability results for the resource-constrained project scheduling problem with a single type of resources |
scientific article; zbMATH DE number 6347868 |
Statements
Approximability results for the resource-constrained project scheduling problem with a single type of resources (English)
0 references
26 September 2014
0 references
project scheduling
0 references
makespan
0 references
lower bounds
0 references
upper bounds
0 references
0 references
0 references
0 references
0 references
0 references
0.7870503067970276
0 references
0.7777185440063477
0 references
0.7767882347106934
0 references
0.7730899453163147
0 references
0.7701233625411987
0 references
