Scheduling on (Un-)Related Machines with Setup Times

09/27/2018
by   Klaus Jansen, et al.
0

We consider a natural generalization of scheduling n jobs on m parallel machines so as to minimize the makespan. In our extension the set of jobs is partitioned into several classes and a machine requires a setup whenever it switches from processing jobs of one class to jobs of a different class. During such a setup, a machine cannot process jobs and the duration of a setup may depend on the machine as well as the class of the job to be processed next. For this problem, we study approximation algorithms for non-identical machines. We develop a polynomial-time approximation scheme for uniformly related machines. For unrelated machines we obtain an O( n + m)-approximation, which we show to be optimal (up to constant factors) unless NP ⊂ RP. We also identify two special cases that admit constant factor approximations.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/26/2019

Approximation Algorithms for Scheduling with Class Constraints

Assigning jobs onto identical machines with the objective to minimize th...
01/19/2018

Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times

Integer linear programs of configurations, or configuration IPs, are a c...
10/18/2019

Approximating Weighted Completion Time for Order Scheduling with Setup Times

Consider a scheduling problem in which jobs need to be processed on a si...
07/24/2021

Fair Allocation with Interval Scheduling Constraints

We study a fair resource scheduling problem, where a set of interval job...
11/12/2021

EPTAS for parallel identical machine scheduling with time restrictions

We consider the non-preemptive scheduling problem on identical machines ...
02/27/2018

A unified framework for designing EPTAS's for load balancing on parallel machines

We consider a general load balancing problem on parallel machines. Our m...
01/27/2020

Approximations for Throughput Maximization

In this paper we study the classical problem of throughput maximization....
This week in AI

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