Article thumbnail

On the job rotation problem

By Peter Butkovic and Seth Charles Lewis


The job rotation problem (JRP) is the following: Given an \(n \times n\) matrix \(A\) over \(\Re \cup \{\ -\infty\ \}\\) and \(k \leq n\), find a \(k \times k\) principal submatrix of \(A\) whose optimal assignment problem value is maximum. No polynomial algorithm is known for solving this problem if \(k\) is an input variable. We analyse JRP and present polynomial solution methods for a number of special cases

Topics: QA Mathematics
Publisher: Elsevier
Year: 2007
OAI identifier:

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

Suggested articles