Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

30

DISOPT
2007

favoriteEmaildiscussreport

90views more DISOPT 2007»

On the job rotation problem

13 years 11 months ago

On the job rotation problem

Download eprints.bham.ac.uk

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

Peter Butkovic, Seth Lewis

Real-time Traffic

DISOPT 2007 | Job Rotation Problem | Optimal Assignment Problem | Present Polynomial Solution |

claim paper

Related Content

» The Constrained Minimum Weighted Sum of Job Completion Times Problem

» Job Shop Scheduling Problems with Controllable Processing Times

» Reachability Problems in Quaternion Matrix and Rotation Semigroups

» Cost sharing in a job scheduling problem using the Shapley value

» The Job Assignment Problem A Study in Parallel and Distributed Machine Learning

» Singlemachine group scheduling problems with deterioration consideration

» Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Pro...

» CostOptimal Job Allocation Schemes for BandwidthConstrained Distributed Computing Systems

» Multiple orders per job batch scheduling with incompatible jobs

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	DISOPT
Authors	Peter Butkovic, Seth Lewis

Comments (0)