A binary-rounding heuristic for multi-period variable-task-duration assignment problems (Q1919790)
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 binary-rounding heuristic for multi-period variable-task-duration assignment problems |
scientific article; zbMATH DE number 909738
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A binary-rounding heuristic for multi-period variable-task-duration assignment problems |
scientific article; zbMATH DE number 909738 |
Statements
A binary-rounding heuristic for multi-period variable-task-duration assignment problems (English)
0 references
19 January 1997
0 references
multi-period assignment
0 references
multiple time periods
0 references
three-dimensional assignment
0 references
0 references
0 references
0.86553055
0 references
0.85566974
0 references
0.8502483
0 references
0.84901285
0 references
0.84896266
0 references
0.84889984
0 references
0.8486024
0 references
