A binary-rounding heuristic for multi-period variable-task-duration assignment problems (Q1919790): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:46, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A binary-rounding heuristic for multi-period variable-task-duration assignment problems |
scientific article |
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
