Another well-solvable case of the QAP: maximizing the job completion time variance (Q1758277): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.orl.2012.06.005 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ORL.2012.06.005 / rank | |||
Normal rank | |||
Latest revision as of 08:53, 11 December 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
0 references
