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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by one other user not shown)
aliases / en / 0aliases / en / 0
 
On the Value of Job Migration in Online Makespan Minimization
description / endescription / en
scientific article
scientific article; zbMATH DE number 6086313
Property / title
 
On the Value of Job Migration in Online Makespan Minimization (English)
Property / title: On the Value of Job Migration in Online Makespan Minimization (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1365.68474 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-33090-2_9 / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithms – ESA 2012 / rank
 
Normal rank
Property / publication date
 
25 September 2012
Timestamp+2012-09-25T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 25 September 2012 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6086313 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1736299573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The load rebalancing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bounds for Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better lower bound for on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for an ancient scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for randomized on-line scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for preemptive on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Reordering for Online Minimum Makespan Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3031924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Better Algorithm for an Ancient Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for the Online Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling with Bounded Migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for randomized on-line multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with reassignment / rank
 
Normal rank

Latest revision as of 13: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

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
0 references
10 October 2017
0 references
25 September 2012
0 references
0 references
0 references
0 references
0 references
0 references
scheduling
0 references
makespan minimization
0 references
online algorithm
0 references
competitive analysis
0 references
job migration
0 references
0 references
0 references
0 references