Minimizing total weighted late work in the resource-constrained project scheduling problem (Q1792320)
From MaRDI portal
!
WARNING
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 6952148
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total weighted late work in the resource-constrained project scheduling problem |
scientific article; zbMATH DE number 6952148 |
Statements
Minimizing total weighted late work in the resource-constrained project scheduling problem (English)
0 references
11 October 2018
0 references
resource-constrained project scheduling
0 references
late work
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8172897100448608
0 references
0.7994014024734497
0 references
0.7988970875740051
0 references
0.7822386622428894
0 references
