Cardinality Constrained Scheduling in Online Models

01/13/2022
by   Leah Epstein, et al.
0

Makespan minimization on parallel identical machines is a classical and intensively studied problem in scheduling, and a classic example for online algorithm analysis with Graham's famous list scheduling algorithm dating back to the 1960s. In this problem, jobs arrive over a list and upon an arrival, the algorithm needs to assign the job to a machine. The goal is to minimize the makespan, that is, the maximum machine load. In this paper, we consider the variant with an additional cardinality constraint: The algorithm may assign at most k jobs to each machine where k is part of the input. While the offline (strongly NP-hard) variant of cardinality constrained scheduling is well understood and an EPTAS exists here, no non-trivial results are known for the online variant. We fill this gap by making a comprehensive study of various different online models. First, we show that there is a constant competitive algorithm for the problem and further, present a lower bound of 2 on the competitive ratio of any online algorithm. Motivated by the lower bound, we consider a semi-online variant where upon arrival of a job of size p, we are allowed to migrate jobs of total size at most a constant times p. This constant is called the migration factor of the algorithm. Algorithms with small migration factors are a common approach to bridge the performance of online algorithms and offline algorithms. One can obtain algorithms with a constant migration factor by rounding the size of each incoming job and then applying an ordinal algorithm to the resulting rounded instance. With this in mind, we also consider the framework of ordinal algorithms and characterize the competitive ratio that can be achieved using the aforementioned approaches.

READ FULL TEXT

page 3

page 5

page 7

page 13

page 25

page 26

page 29

page 31

research
06/13/2022

Bin stretching with migration on two hierarchical machines

In this paper, we consider semi-online scheduling with migration on two ...
research
01/22/2022

Scheduling Policies for Stability and Optimal Server Running Cost in Cloud Computing Platforms

We propose throughput and cost optimal job scheduling algorithms in clou...
research
01/20/2020

A 2-Competitive Largest Job on Least Loaded Machine Online Algorithm based on Multi Lists Scheduling Model

Online scheduling in identical machines with makespan minimization has b...
research
06/19/2023

Scheduling with cardinality dependent unavailability periods

We consider non-preemptive scheduling problems on parallel identical mac...
research
11/29/2022

Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse

We consider the online unrelated-machine load balancing problem with rec...
research
09/01/2022

Online Load Balancing on Uniform Machines with Limited Migration

In the problem of online load balancing on uniformly related machines wi...
research
04/04/2022

The Cardinal Complexity of Comparison-based Online Algorithms

We consider ordinal online problems, i.e., those tasks that only depend ...

Please sign up or login with your details

Forgot password? Click here to reset