A binary-rounding heuristic for multi-period variable-task-duration assignment problems (Q1919790): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0305-0548(95)00073-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1999751861 / rank | |||
Normal rank | |||
Revision as of 01:16, 20 March 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
