Another well-solvable case of the QAP: maximizing the job completion time variance (Q1758277): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Vladimir G. Deǐneko / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Gerhard J. Woeginger / rank | |||
Normal rank | |||
Revision as of 06:48, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Another well-solvable case of the QAP: maximizing the job completion time variance |
scientific article |
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
