The Library
Another well-solvable case of the QAP : maximizing the job completion time variance
Tools
Tools
Tools
Çela, Eranda, Deineko, Vladimir G. and Woeginger, Gerhard J. (2012) Another well-solvable case of the QAP : maximizing the job completion time variance. Operations Research Letters, Vol.40 (No.5). pp. 356-359. doi:10.1016/j.orl.2012.06.005 ISSN 0167-6377.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1016/j.orl.2012.06.005
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.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics | ||||
| Divisions: | Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences Faculty of Social Sciences > Warwick Business School |
||||
| Journal or Publication Title: | Operations Research Letters | ||||
| Publisher: | Elsevier BV | ||||
| ISSN: | 0167-6377 | ||||
| Official Date: | September 2012 | ||||
| Dates: |
|
||||
| Volume: | Vol.40 | ||||
| Number: | No.5 | ||||
| Page Range: | pp. 356-359 | ||||
| DOI: | 10.1016/j.orl.2012.06.005 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
