Scheduling to Approximate Minimization Objectives on Identical Machines

by   Benjamin Moseley, et al.

This paper considers scheduling on identical machines. The scheduling objective considered in this paper generalizes most scheduling minimization problems. In the problem, there are n jobs and each job j is associated with a monotonically increasing function g_j. The goal is to design a schedule that minimizes ∑_j ∈ [n] g_j(C_j) where C_j is the completion time of job j in the schedule. An O(1)-approximation is known for the single machine case. On multiple machines, this paper shows that if the scheduler is required to be either non-migratory or non-preemptive then any algorithm has an unbounded approximation ratio. Using preemption and migration, this paper gives a O( nP)-approximation on multiple machines, the first result on multiple machines. These results imply the first non-trivial positive results for several special cases of the problem considered, such as throughput minimization and tardiness. Natural linear programs known for the problem have a poor integrality gap. The results are obtained by strengthening a natural linear program for the problem with a set of covering inequalities we call job cover inequalities. This linear program is rounded to an integral solution by building on quasi-uniform sampling and rounding techniques.


page 1

page 2

page 3

page 4


Geometry of Scheduling on Multiple Machines

We consider the following general scheduling problem: there are m identi...

EPTAS for load balancing problem on parallel machines with a non-renewable resource

The problem considered is the non-preemptive scheduling of independent j...

Closing the gap for single resource constraint scheduling

In the problem called single resource constraint scheduling, we are give...

Joint Machine-Transporter Scheduling for Multistage Jobs with Adjustable Computation Time

This paper presents a scalable solution with adjustable computation time...

Breaking symmetries to rescue Sum of Squares: The case of makespan scheduling

The Sum of Squares (SoS) hierarchy gives an automatized technique to cre...

Scheduling on parallel machines with a common server in charge of loading and unloading operations

This paper addresses the scheduling problem on two identical parallel ma...

Scheduling with cardinality dependent unavailability periods

We consider non-preemptive scheduling problems on parallel identical mac...

Please sign up or login with your details

Forgot password? Click here to reset