Scheduling with Contact Restrictions – A Problem Arising in Pandemics

02/16/2021
by   Moritz Buchem, et al.
0

We study a scheduling problem arising in pandemic times where jobs should keep sufficient distance during transit times to machines. To model this, each job has a transit time before and after its processing time, i.e., three parameters. We seek conflict-free schedules in which the transit times of no two jobs on machines in close proximity intersect. More formally, for the problem "Scheduling with Contact Restrictions" (SCR), we are given a set of jobs, a set of machines, and a conflict graph on the machines. The goal is to find a conflict-free schedule of minimum makespan. We show that, unless P=NP, the problem does not allow for a constant factor approximation even for identical jobs and every choice of fixed positive parameters, including the unit case. However, given an oracle for a maximum collection of disjoint independent sets , we provide a 2-approximation algorithm for identical jobs. Moreover, we present optimal and near optimal schedules for unit jobs on several graph classes. For bipartite graphs, we give a 4/3-approximation and an asymptotic 7/6-approximation. Furthermore, we solve the problem on complete graphs, complete bipartite graphs, and traceable bipartite graphs in polynomial time. For trees, we compute schedules with highest load density yielding near optimal solutions.

READ FULL TEXT

page 1

page 3

page 5

page 6

page 7

page 13

page 17

page 19

research
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...
research
07/12/2022

Task scheduling for block-type conflict graphs

In this paper, we consider the scheduling of jobs on parallel machines, ...
research
08/04/2022

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 ...
research
05/21/2019

Approximation results for makespan minimization with budgeted uncertainty

We study approximation algorithms for the problem of minimizing the make...
research
10/23/2019

Maintenance scheduling in a railway corricdor

We investigate a novel scheduling problem which is motivated by an appli...
research
03/07/2018

Approximation algorithms for two-machine flow-shop scheduling with a conflict graph

Path cover is a well-known intractable problem that finds a minimum numb...
research
07/18/2020

Additive Approximation Schemes for Load Balancing Problems

In this paper we introduce the concept of additive approximation schemes...

Please sign up or login with your details

Forgot password? Click here to reset