AI Chat AI Image Generator AI Video Text to Speech

A Competitive Algorithm for Throughout Maximization on Identical Machines

11/12/2021

∙

by Benjamin Moseley, et al.

∙

∙

This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline on m identical machines. The main result is an O(1) competitive deterministic algorithm for any number of machines m >1.

Benjamin Moseley
40 publications
Kirk Pruhs
14 publications
Clifford Stein
10 publications
Rudy Zhou
6 publications

page 1

page 2

page 3

page 4

research

∙ 05/05/2021

Scheduling with Testing on Multiple Identical Parallel Machines

Scheduling with testing is a recent online problem within the framework ...

0 Susanne Albers, et al. ∙

research

∙ 05/21/2019

Approximation results for makespan minimization with budgeted uncertainty

We study approximation algorithms for the problem of minimizing the make...

0 Marin Bougeret, et al. ∙

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

0 Weidong Li, et al. ∙

research

∙ 10/11/2022

Parallel solutions for preemptive makespan scheduling on two identical machines

We consider online preemptive scheduling of jobs arriving one by one, to...

0 Leah Epstein, et al. ∙

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

0 Leah Epstein, et al. ∙

research

∙ 03/21/2019

Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem

The no-wait flowshop scheduling problem is a variant of the classical pe...

0 Lucien Mousin, et al. ∙

research

∙ 05/30/2020

Scheduling in the Random-Order Model

Makespan minimization on identical machines is a fundamental problem in ...

0 Susanne Albers, et al. ∙