Online computation and competitive analysis
Online computation and competitive analysis
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An approximation algorithm for max-min fair allocation of indivisible goods
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A robust APTAS for the classical bin packing problem
Mathematical Programming: Series A and B
Online Scheduling with Bounded Migration
Mathematics of Operations Research
Note: Tight bounds for bandwidth allocation on two links
Discrete Applied Mathematics
A robust PTAS for machine covering and packing
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
The exact LPT-bound for maximizing the minimum completion time
Operations Research Letters
A polynomial-time approximation scheme for maximizing the minimum machine completion time
Operations Research Letters
| Hi-index | 0.09 |
We study an on-line machine covering problem, in which jobs arrive one by one and their processing times are known upon their arrival, and jobs are allowed to migrate between machines when a new job is added in the system. However, the total processing time of migration induced by an incoming job is bounded by a constant factor @b times the processing time of the incoming job. The objective is to maximize the minimum machine load. In this paper, we present an on-line algorithm with competitive ratio 6/5 for the two identical machines case with @b=1. Moreover, the presented on-line algorithm is only a local migration, that is, when one job is assigned to machine i, only the jobs on machine i are allowed to migrate. We also show that the provided algorithm is a best possible on-line algorithm in the sense of local migration.