Online Scheduling with Bounded Migration

Consider the classical online scheduling problem, in which jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We generalize this problem by allowing the current assignment to be changed whenever a new job arrives, subject to the con...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematics of operations research Ročník 34; číslo 2; s. 481 - 498
Hlavní autoři: Sanders, Peter, Sivadasan, Naveen, Skutella, Martin
Médium: Journal Article
Jazyk:angličtina
Vydáno: Linthicum INFORMS 01.05.2009
Institute for Operations Research and the Management Sciences
Témata:
Algorithms
Analysis
Approximation
Approximation algorithms
Approximations
Data models
Integers
Mathematical constants
Mathematical optimization
Mathematical procedures
online algorithm
Production scheduling
Ratios
Scheduling
Scheduling (Management)
Scheduling algorithms
Sensitivity analysis
Studies
United States
ISSN:0364-765X, 1526-5471
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Consider the classical online scheduling problem, in which jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We generalize this problem by allowing the current assignment to be changed whenever a new job arrives, subject to the constraint that the total size of moved jobs is bounded by some constant times the size of the arriving job. This constant is called the migration factor. For small migration factors, we obtain several simple online algorithms with constant competitive ratio. We also present a linear time "online approximation scheme," that is, a family of online algorithms with competitive ratio arbitrarily close to 1 and constant migration factor.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0364-765X
1526-5471
DOI:10.1287/moor.1090.0381