Task scheduling for block-type conflict graphs

by   Hanna Furmańczyk, et al.

In this paper, we consider the scheduling of jobs on parallel machines, under incompatibility relation modeled as a block graph, under the makespan optimality criterion. In this model, no two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine. The presented model stems from a well-established line of research combining scheduling theory with methods relevant to graph coloring. Recently, cluster graphs and their extensions like block graphs were given additional attention. We complement hardness results provided by other researchers for block graphs by providing approximation algorithms. In particular, we provide a 2-approximation algorithm for identical machines and PTAS for its special case with unit time jobs. In the case of uniform machines, we analyze two cases: when the number of blocks is bounded; and when the number of blocks is arbitrary, but the number of cut-vertices is bounded and jobs are unit time processing length. Finally, we consider unrelated machines and we present an FPTAS for graphs with bounded treewidth and a bounded number of machines.


page 1

page 2

page 3

page 4


Scheduling on uniform and unrelated machines with bipartite incompatibility graphs

In this paper the problem of scheduling of jobs on parallel machines und...

Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines

In this paper we consider the problem of scheduling on parallel machines...

Scheduling with Contact Restrictions – A Problem Arising in Pandemics

We study a scheduling problem arising in pandemic times where jobs shoul...

Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995^n) time

In a classical scheduling problem, we are given a set of n jobs of unit ...

A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graph with Bounded Tree-width

In this paper we study a scheduling problem arising from executing numer...

Approximation results for makespan minimization with budgeted uncertainty

We study approximation algorithms for the problem of minimizing the make...

Parallel solutions for preemptive makespan scheduling on two identical machines

We consider online preemptive scheduling of jobs arriving one by one, to...

Please sign up or login with your details

Forgot password? Click here to reset