On the job rotation problem

The job rotation problem (JRP) is the following: Given an n × n matrix A over R ∪ {−∞} and k ≤ n, find a k × 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.

• Type: Journal
• Year: 2007
• Where: DISOPT
• Authors: Peter Butkovic, Seth Lewis
• Keywords: DISOPT 2007, Job Rotation Problem, Optimal Assignment Problem, Present Polynomial Solution