On the value of job migration in online makespan minimization (Q2408930): Difference between revisions

Latest revision as of 12:22, 14 July 2024

scientific article; zbMATH DE number 6086313

On the Value of Job Migration in Online Makespan Minimization

Language	Label	Description	Also known as
English	On the value of job migration in online makespan minimization	scientific article; zbMATH DE number 6086313	On the Value of Job Migration in Online Makespan Minimization

Statements

instance of

scholarly article

0 references

title

On the value of job migration in online makespan minimization (English)

0 references

On the Value of Job Migration in Online Makespan Minimization (English)

0 references

0 references

0 references

0 references

Algorithms – ESA 2012

0 references

publication date

10 October 2017

0 references

25 September 2012

0 references

full work available at URL

https://arxiv.org/abs/1111.0773

0 references

zbMATH Keywords

scheduling

0 references

makespan minimization

0 references

online algorithm

0 references

competitive analysis

0 references

job migration

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

The load rebalancing problem

0 references

Better Bounds for Online Scheduling

0 references

A better lower bound for on-line scheduling

0 references

New algorithms for an ancient scheduling problem.

0 references

A lower bound for randomized on-line scheduling algorithms

0 references

An optimal algorithm for preemptive on-line scheduling

0 references

The Power of Reordering for Online Minimum Makespan Scheduling

0 references

Q3031924

0 references

On-line scheduling revisited

0 references

An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling

0 references

Bounds for Certain Multiprocessing Anomalies

0 references

Bounds on Multiprocessing Timing Anomalies

0 references

Q4952670

0 references

A Better Algorithm for an Ancient Scheduling Problem

0 references

Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines

0 references

Improved Bounds for the Online Scheduling Problem

0 references

Online Scheduling with Bounded Migration

0 references

A lower bound for randomized on-line multiprocessor scheduling

0 references

Online scheduling with reassignment

0 references

Identifiers

zbMATH Open document ID

1372.68039

0 references

1365.68474

0 references

DOI

10.1007/s00453-016-0209-9

0 references

10.1007/978-3-642-33090-2_9

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2408930

@@ Property / cites work @@
+The load rebalancing problem
@@ Property / cites work: The load rebalancing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Better Bounds for Online Scheduling
@@ Property / cites work: Better Bounds for Online Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+A better lower bound for on-line scheduling
@@ Property / cites work: A better lower bound for on-line scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+New algorithms for an ancient scheduling problem.
@@ Property / cites work: New algorithms for an ancient scheduling problem. / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for randomized on-line scheduling algorithms
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for preemptive on-line scheduling
+Normal rank
@@ Property / cites work @@
+The Power of Reordering for Online Minimum Makespan Scheduling
+Normal rank
@@ Property / cites work @@
+Q3031924
@@ Property / cites work: Q3031924 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line scheduling revisited
@@ Property / cites work: On-line scheduling revisited / rank @@
+Normal rank
@@ Property / cites work @@
+An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
+Normal rank
@@ Property / cites work @@
+Bounds for Certain Multiprocessing Anomalies
@@ Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on Multiprocessing Timing Anomalies
@@ Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952670
@@ Property / cites work: Q4952670 / rank @@
+Normal rank
@@ Property / cites work @@
+A Better Algorithm for an Ancient Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
+Normal rank
@@ Property / cites work @@
+Improved Bounds for the Online Scheduling Problem
@@ Property / cites work: Improved Bounds for the Online Scheduling Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Online Scheduling with Bounded Migration
@@ Property / cites work: Online Scheduling with Bounded Migration / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for randomized on-line multiprocessor scheduling
+Normal rank
@@ Property / cites work @@
+Online scheduling with reassignment
@@ Property / cites work: Online scheduling with reassignment / rank @@
+Normal rank