Another well-solvable case of the QAP: maximizing the job completion time variance
type: Item
instance of: scholarly article
title: Another well-solvable case of the QAP: maximizing the job completion time variance
zbMATH Open document ID: 1250.90045
author: Eranda Çela
author: Vladimir G. Deineko
author: Gerhard J. Woeginger
published in: Operations Research Letters
publication date: 2012-11-08T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6103790
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: quadratic assignment problem
zbMATH Keywords: machine scheduling
zbMATH Keywords: well-solvable special case
MaRDI profile type: Publication
full work available at URL: j.orl.2012.06.005
OpenAlex ID: W2096919221
cites work: The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
cites work: Perspectives of Monge properties in optimization
cites work: The quadratic assignment problem. Theory and algorithms
cites work: The Wiener maximum quadratic assignment problem
cites work: On the Minimization of Completion Time Variance with a Bicriteria Extension
cites work: A solvable case of the quadratic assignment problem
cites work: Minimising Waiting Time Variance in the Single Machine Problem
cites work: Q4039929
cites work: Assignment Problems and the Location of Economic Activities
cites work: Completion time variance minimization on a single machine is difficult
cites work: The cone of Monge matrices: Extremal rays and applications
cites work: Minimizing the Time-in-System Variance for a Finite Jobset
cites work: Extreme Hamiltonian lines
cites work: Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized
DOI: 10.1016/J.ORL.2012.06.005
description: scientific article; zbMATH DE number 6103790