Online makespan minimization with parallel schedules (Q2362356): Difference between revisions

Latest revision as of 03:07, 14 July 2024

scientific article; zbMATH DE number 6339243

Online Makespan Minimization with Parallel Schedules

Language	Label	Description	Also known as
English	Online makespan minimization with parallel schedules	scientific article; zbMATH DE number 6339243	Online Makespan Minimization with Parallel Schedules

Statements

instance of

scholarly article

0 references

title

Online makespan minimization with parallel schedules (English)

0 references

Online Makespan Minimization with Parallel Schedules (English)

0 references

0 references

0 references

0 references

Algorithm Theory – SWAT 2014

0 references

publication date

7 July 2017

0 references

2 September 2014

0 references

full work available at URL

https://arxiv.org/abs/1304.5625

0 references

zbMATH Keywords

scheduling

0 references

makespan minimization

0 references

online algorithms

0 references

competitive analysis

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Better Bounds for Online Scheduling

0 references

On the value of job migration in online makespan minimization

0 references

The on-line multiprocessor scheduling problem with known sum of the tasks

0 references

Semi-on-line scheduling on two parallel processors with an upper bound on the items

0 references

Q5387663

0 references

On-line bin-stretching

0 references

A better lower bound for on-line scheduling

0 references

New algorithms for an ancient scheduling problem.

0 references

A Better Algorithm for an Ancient Scheduling Problem

0 references

An Online Algorithm for Improving Performance in Navigation

0 references

Navigating in Unfamiliar Geometric Terrain

0 references

On the Advice Complexity of the k-Server Problem

0 references

Better Algorithms for Online Bin Stretching

0 references

Semi-on-line multiprocessor scheduling with given total processing time

0 references

How to learn an unknown environment. I

0 references

Online computation with advice

0 references

The Power of Reordering for Online Minimum Makespan Scheduling

0 references

Q3031924

0 references

Q5538132

0 references

On-line scheduling revisited

0 references

Collective tree exploration

0 references

Online bin stretching with bunch techniques

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

Q4952670

0 references

Coloring inductive graphs on-line

0 references

An efficient algorithm for bin stretching

0 references

Semi on-line algorithms for the partition problem

0 references

On-line parallel heuristics, processor scheduling and robot searching under the competitive framework

0 references

An on-line graph coloring algorithm with sublinear performance ratio

0 references

Online algorithms with advice for bin packing and scheduling problems

0 references

Improved Bounds for the Online Scheduling Problem

0 references

Online Scheduling with Bounded Migration

0 references

Identifiers

zbMATH Open document ID

1370.68331

0 references

1366.68370

0 references

DOI

10.1007/s00453-016-0172-5

0 references

10.1007/978-3-319-08404-6_2

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2362356

@@ Property / cites work @@
+Better Bounds for Online Scheduling
@@ Property / cites work: Better Bounds for Online Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+On the value of job migration in online makespan minimization
+Normal rank
@@ Property / cites work @@
+The on-line multiprocessor scheduling problem with known sum of the tasks
+Normal rank
@@ Property / cites work @@
+Semi-on-line scheduling on two parallel processors with an upper bound on the items
+Normal rank
@@ Property / cites work @@
+Q5387663
@@ Property / cites work: Q5387663 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line bin-stretching
@@ Property / cites work: On-line bin-stretching / 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 Better Algorithm for an Ancient Scheduling Problem
+Normal rank
@@ Property / cites work @@
+An Online Algorithm for Improving Performance in Navigation
+Normal rank
@@ Property / cites work @@
+Navigating in Unfamiliar Geometric Terrain
@@ Property / cites work: Navigating in Unfamiliar Geometric Terrain / rank @@
+Normal rank
@@ Property / cites work @@
+On the Advice Complexity of the k-Server Problem
@@ Property / cites work: On the Advice Complexity of the k-Server Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Better Algorithms for Online Bin Stretching
@@ Property / cites work: Better Algorithms for Online Bin Stretching / rank @@
+Normal rank
@@ Property / cites work @@
+Semi-on-line multiprocessor scheduling with given total processing time
+Normal rank
@@ Property / cites work @@
+How to learn an unknown environment. I
@@ Property / cites work: How to learn an unknown environment. I / rank @@
+Normal rank
@@ Property / cites work @@
+Online computation with advice
@@ Property / cites work: Online computation with advice / rank @@
+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 @@
+Q5538132
@@ Property / cites work: Q5538132 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line scheduling revisited
@@ Property / cites work: On-line scheduling revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Collective tree exploration
@@ Property / cites work: Collective tree exploration / rank @@
+Normal rank
@@ Property / cites work @@
+Online bin stretching with bunch techniques
@@ Property / cites work: Online bin stretching with bunch techniques / 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 @@
+Q4952670
@@ Property / cites work: Q4952670 / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring inductive graphs on-line
@@ Property / cites work: Coloring inductive graphs on-line / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for bin stretching
@@ Property / cites work: An efficient algorithm for bin stretching / rank @@
+Normal rank
@@ Property / cites work @@
+Semi on-line algorithms for the partition problem
@@ Property / cites work: Semi on-line algorithms for the partition problem / rank @@
+Normal rank
@@ Property / cites work @@
+On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
+Normal rank
@@ Property / cites work @@
+An on-line graph coloring algorithm with sublinear performance ratio
+Normal rank
@@ Property / cites work @@
+Online algorithms with advice for bin packing and scheduling problems
+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