Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Theory of linear and integer programming
Theory of linear and integer programming
A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A lower bound for randomized on-line scheduling algorithms
Information Processing Letters
New algorithms for an ancient scheduling problem
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
A better algorithm for an ancient scheduling problem
Journal of Algorithms
Various notions of approximations: good, better, best, and more
Approximation algorithms for NP-hard problems
A lower bound for randomized on-line multiprocessor scheduling
Information Processing Letters
Algorithms for Scheduling Independent Tasks
Journal of the ACM (JACM)
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
Better Bounds for Online Scheduling
SIAM Journal on Computing
Load balancing for response time
Journal of Algorithms
Compact, adaptive placement schemes for non-uniform requirements
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Developments from a June 1996 seminar on Online algorithms: the state of the art
Improved Bounds for the Online Scheduling Problem
SIAM Journal on Computing
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A robust APTAS for the classical bin packing problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A polynomial-time approximation scheme for maximizing the minimum machine completion time
Operations Research Letters
A robust PTAS for machine covering and packing
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Online scheduling with rearrangement on two related machines
Theoretical Computer Science
Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
Information Processing Letters
On-line machine covering on two machines with local migration
Computers & Mathematics with Applications
Optimal algorithms for online scheduling with bounded rearrangement at the end
Theoretical Computer Science
Robust algorithms for preemptive scheduling
ESA'11 Proceedings of the 19th European conference on Algorithms
Online removable square packing
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Migration, assignment, and scheduling of jobs in virtualized environment
HotCloud'11 Proceedings of the 3rd USENIX conference on Hot topics in cloud computing
D-factor: a quantitative model of application slow-down in multi-resource shared systems
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Online scheduling with one rearrangement at the end: Revisited
Information Processing Letters
Online minimum makespan scheduling with a buffer
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
On the value of job migration in online makespan minimization
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Reallocation problems in scheduling
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
The power of deferral: maintaining a constant-competitive steiner tree online
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A robust AFPTAS for online bin packing with polynomial migration,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Recent advances for a classical scheduling problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
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.