Another well-solvable case of the QAP: Maximizing the job completion time variance

E. Çela; V.G. Deineko; G.J. Woeginger

doi:10.1016/j.orl.2012.06.005

Another well-solvable case of the QAP: Maximizing the job completion time variance

E. Çela
, V.G. Deineko
, G.J. Woeginger

Research output: Contribution to journal › Article › Academic › peer-review

12 Citations (Scopus)

1 Downloads (Pure)

Abstract

We analyze a special case of the maximum quadratic assignment problem where one matrix is a monotone anti-Monge matrix and the other matrix has a multi-layered structure that is built on top of certain Toeplitz matrices. To demonstrate an application of our main result, we derive a (simple and concise) alternative proof for a recent result on the scheduling problem of maximizing the variance of job completion times.

Original language	English
Pages (from-to)	356-359
Journal	Operations Research Letters
Volume	40
Issue number	5
DOIs	https://doi.org/10.1016/j.orl.2012.06.005
Publication status	Published - 2012

Access to Document

10.1016/j.orl.2012.06.005

Cite this

@article{7f5e6faf9d0a46f3b05ee08f63be30b9,

title = "Another well-solvable case of the QAP: Maximizing the job completion time variance",

abstract = "We analyze a special case of the maximum quadratic assignment problem where one matrix is a monotone anti-Monge matrix and the other matrix has a multi-layered structure that is built on top of certain Toeplitz matrices. To demonstrate an application of our main result, we derive a (simple and concise) alternative proof for a recent result on the scheduling problem of maximizing the variance of job completion times.",

author = "E. {\c C}ela and V.G. Deineko and G.J. Woeginger",

year = "2012",

doi = "10.1016/j.orl.2012.06.005",

language = "English",

volume = "40",

pages = "356--359",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "5",

}

TY - JOUR

T1 - Another well-solvable case of the QAP: Maximizing the job completion time variance

AU - Çela, E.

AU - Deineko, V.G.

AU - Woeginger, G.J.

PY - 2012

Y1 - 2012

N2 - We analyze a special case of the maximum quadratic assignment problem where one matrix is a monotone anti-Monge matrix and the other matrix has a multi-layered structure that is built on top of certain Toeplitz matrices. To demonstrate an application of our main result, we derive a (simple and concise) alternative proof for a recent result on the scheduling problem of maximizing the variance of job completion times.

AB - We analyze a special case of the maximum quadratic assignment problem where one matrix is a monotone anti-Monge matrix and the other matrix has a multi-layered structure that is built on top of certain Toeplitz matrices. To demonstrate an application of our main result, we derive a (simple and concise) alternative proof for a recent result on the scheduling problem of maximizing the variance of job completion times.

U2 - 10.1016/j.orl.2012.06.005

DO - 10.1016/j.orl.2012.06.005

M3 - Article

SN - 0167-6377

VL - 40

SP - 356

EP - 359

JO - Operations Research Letters

JF - Operations Research Letters

IS - 5

ER -

Another well-solvable case of the QAP: Maximizing the job completion time variance

Abstract

Access to Document

Fingerprint

Cite this