On the job rotation problem

On the job rotation problem

0.00 Avg rating—0 Votes
Article ID: iaor2008101
Country: Netherlands
Volume: 4
Issue: 2
Start Page Number: 163
End Page Number: 174
Publication Date: Jun 2007
Journal: Discrete Optimization
Authors: ,
Keywords: programming: assignment
Abstract:

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

Reviews

Required fields are marked *. Your email address will not be published.