DeepAI AI Chat
Log In Sign Up

Bin stretching with migration on two hierarchical machines

by   Islam Akaria, et al.
University of Haifa

In this paper, we consider semi-online scheduling with migration on two hierarchical machines, with the purpose of minimizing the makespan. The meaning of two hierarchical machines is that one of the machines can run any job, while the other machine can only run specific jobs. Every instance also has a fixed parameter M ≥0, known as the migration factor. Jobs are presented one by one. Each new job has to be assigned to a machine when it arrives, and at the same time it is possible to modify the assignment of previously assigned jobs, such that the moved jobs have a total size not exceeding M times the size of the new job. The semi-online variant studied here is called bin stretching. In this problem, the optimal makespan is provided to the scheduler in advance. This is still a non-trivial variant for any migration factor M ≥0. We prove tight bounds on the competitive ratio for any migration factor M, where the design and analysis is split into several cases, based on the value of M, and the resulting competitive ratio. Unlike the online variant with migration for two hierarchical machines, this case allows an online approximation scheme.


page 1

page 2

page 3

page 4


Online Load Balancing on Uniform Machines with Limited Migration

In the problem of online load balancing on uniformly related machines wi...

Cardinality Constrained Scheduling in Online Models

Makespan minimization on parallel identical machines is a classical and ...

Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work

In this study, we investigated several online and semi-online scheduling...

New Recruiter and Jobs: The Largest Enterprise Data Migration at LinkedIn

In August 2019, we introduced to our members and customers the idea of m...

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...

(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling

We consider variants of the restricted assignment problem where a set of...

Robust Online Algorithms for Dynamic Choosing Problems

Semi-online algorithms that are allowed to perform a bounded amount of r...