Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines

10/25/2020
by   Tytus Pikies, et al.
0

In this paper we consider the problem of scheduling on parallel machines with a presence of incompatibilities between jobs. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. Our research stems from the work of Bodlaender et al. [1992, 1993]. In particular, we pursue the line investigated partially by Mallek et al. [2019], where the graph is complete multipartite so each machine can do jobs only from one partition. We also tie our results to the recent approach for so-called identical machines with class constraints by Jansen et al. [2019], providing a link between our case and their generalization. In the paper we provide several algorithms constructing schedules, optimal or approximate with respect to the two most popular criteria of optimality: Cmax (the makespan) and ΣCj(the total completion time). We consider a variety of machine types in our paper: identical, uniform, unrelated, and a natural subcase of unrelated machines. Our results consist of delimitation of the easy (polynomial) and NP-hard problems within these constraints. In the case when the problem is hard, we also provide algorithm, either with a guaranteed constant worst-case approximation ratio or even in some cases a PTAS. In particular, we fill the gap on research for the problem of finding a schedule with smallest total completion time on uniform machines. We address this problem by developing a linear programming relaxation technique with an appropriate rounding, which to our knowledge is a novelty for this criterion in the considered setting.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/12/2020

Total Completion Time Minimization for Scheduling with Incompatibility Cliques

This paper considers parallel machine scheduling with incompatibilities ...
06/28/2021

Scheduling on uniform and unrelated machines with bipartite incompatibility graphs

In this paper the problem of scheduling of jobs on parallel machines und...
05/31/2019

Budget Minimization with Precedence Constraints

Budget Minimization is a scheduling problem with precedence constraints,...
11/12/2021

EPTAS for parallel identical machine scheduling with time restrictions

We consider the non-preemptive scheduling problem on identical machines ...
04/30/2020

Communication-Aware Scheduling of Precedence-Constrained Tasks on Related Machines

Scheduling precedence-constrained tasks is a classical problem that has ...
01/14/2020

Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution

We give a 1.488-approximation for the classic scheduling problem of mini...
01/11/2022

A PTAS for parallel two-stage flowshops under makespan constraint

As a hybrid of the Parallel Two-stage Flowshop problem and the Multiple ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.