Another well-solvable case of the QAP: maximizing the job completion time variance (Q1758277)
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 6103790
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Another well-solvable case of the QAP: maximizing the job completion time variance |
scientific article; zbMATH DE number 6103790 |
Statements
Another well-solvable case of the QAP: maximizing the job completion time variance (English)
0 references
8 November 2012
0 references
combinatorial optimization
0 references
quadratic assignment problem
0 references
machine scheduling
0 references
well-solvable special case
0 references
0 references
0.8240142464637756
0 references
0.8164852857589722
0 references
0.8038929104804993
0 references
