2018/09/13 by Teun Janssen, Céline M. F. Swennenhuis, Janssen, T. +13
Computer Science · Engineering · #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Packing Problems #Optimization and Search Problems #Scheduling and Optimization Algorithms
paper · pdf · doi:10.48550/arxiv.1809.05009
openalex publication_date 2018/09/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the problem of scheduling jobs on parallel machines minimizing the total completion time, with each job using exactly one resource. First, we derive fundamental properties of the problem and show that the problem is polynomially solvable if pj = 1. Then we look at a variant of the shortest processing time rule as an approximation algorithm for the problem and show that it gives at least a (2-(1)/(m))-approximation. Subsequently, we show that, although the complexity of the problem remains open, three related problems are NP-hard. In the first problem, every resource also has a subset of machines on which it can be used. In the second problem, once a resource has been used on a machine it cannot be used on any other machine, hence all jobs using the same resource need to be scheduled on the same machine. In the third problem, every job needs exactly two resources instead of just one.