1125 search results - page 1 / 225 » On the job rotation problem |
DISOPT
2007
13 years 5 months ago
2007
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...
IPCO
2004
13 years 6 months ago
2004
We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weigh...
ICTCS
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing t...
MFCS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We examine computational problems on quaternion matrix and rotation semigroups. It is shown that in the ultimate case of quaternion matrices, in which multiplication is s...
SIGECOM
2005
ACM
13 years 11 months ago
2005
ACM
A set of jobs need to be served by a single server which can serve only one job at a time. Jobs have processing times and incur waiting costs (linear in their waiting time). The j...