On the job rotation problem

Authors:
Peter Butkovič;Seth Lewis
Affiliations:
School of Mathematics, The University of Birmingham, Edgbaston, Birmingham B15 2TT, United Kingdom;School of Mathematics, The University of Birmingham, Edgbaston, Birmingham B15 2TT, United Kingdom
Venue:
Discrete Optimization
Year:
2007

Citing 5
Cited 1

Handbook of theoretical computer science (vol. A): algorithms and complexity

Handbook of theoretical computer science (vol. A): algorithms and complexity
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Selected topics on assignment problems

Discrete Applied Mathematics
Finding all essential terms of a characteristic maxpolynomial

Discrete Applied Mathematics
Handbook of Discrete and Combinatorial Mathematics, Second Edition

Handbook of Discrete and Combinatorial Mathematics, Second Edition

Reducing ergonomic risks by job rotation scheduling

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

The job rotation problem (JRP) is the following: Given an nxn matrix A over R@?{-~} and k@?n, find a kxk 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.