Parallel solutions for preemptive makespan scheduling on two identical machines

10/11/2022
by   Leah Epstein, et al.
0

We consider online preemptive scheduling of jobs arriving one by one, to be assigned to two identical machines, with the goal of makespan minimization. We study the effect of selecting the best solution out of two independent solutions constructed in parallel in an online fashion. Two cases are analyzed, where one case is purely online, and in the other one jobs are presented sorted by non-increasing sizes. We show that using two solutions rather than one improves the performance significantly, but that an optimal solution cannot be obtained for any constant number of solutions constructed in parallel. Our algorithms have the best possible competitive ratios out of algorithms for each one of the classes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/14/2022

Parallel solutions for ordinal scheduling with a small number of machines

We study ordinal makespan scheduling on small numbers of identical machi...
research
11/12/2021

EPTAS for parallel identical machine scheduling with time restrictions

We consider the non-preemptive scheduling problem on identical machines ...
research
11/12/2021

A Competitive Algorithm for Throughout Maximization on Identical Machines

This paper considers the basic problem of scheduling jobs online with pr...
research
01/14/2020

Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems

Online scheduling has been a well studied and challenging research probl...
research
03/06/2022

Efficient Scheduling for Scalable Bioinformatics Analysis Platform with Microservices

With the advancement of biology and computer science, amount of bioinfor...
research
07/12/2022

Task scheduling for block-type conflict graphs

In this paper, we consider the scheduling of jobs on parallel machines, ...
research
07/24/2020

Improved approximation schemes for early work scheduling on identical parallel machines with common due date

We study the early work scheduling problem on identical parallel machine...

Please sign up or login with your details

Forgot password? Click here to reset