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...
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...
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...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...
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...
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...