On-line machine covering on two machines with local migration
Authors: 
Xufeng Chen, Sen QinAuthors Info & Claims
Xufeng Chen, Sen QinAuthors Info & ClaimsPages 2336 - 2341
Abstract
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.
References
[1]
Deuermeyer, B.L., Friesen, D.K. and Langston, M.A., Scheduling to maximize the minimum processor finish time in a multiprocessor system. SIAM Journal on Algebraic and Discrete Methods. v3. 190-196.
[2]
Friesen, D.K. and Deuermeyer, B.L., Analysis of greedy solutions for a replacement part sequencing problem. Mathematics of Operations Research. v6 i1. 74-87.
[3]
Borodin, A. and El-Yaniv, R., Online Computation and Competitive Analysis. 1998. Cambridge University Press.
[4]
Y. Azar, L. Epstein, On-line machine covering, in: Proceedings of the 5th Annual European Symposium on Algorithms, ESA, 1997, pp. 23-36.
[5]
Epstein, L., Tight bounds for bandwidth allocation on two links. Discrete Applied Mathematics. v148 i2. 181-188.
[6]
Csirik, J., Kellerer, H. and Woeginger, G., The exact LPT-bound for maximizing the minimum completion time. Operations Research Letters. v11 i5. 281-287.
[7]
Woeginger, G., A polynomial-time approximation scheme for maximizing the minimum machine completion time. Operations Research Letters. v20 i4. 149-154.
[8]
Sanders, P., Sivadasan, N. and Skutella, M., Online scheduling with bounded migration. Mathematics of Operations Research. v34 i2. 481-498.
[9]
Epstein, L. and Levin, A., A robust APTAS for the classical bin packing problem. Mathematical Programming. v119. 33-49.
[10]
Skutella, M. and Verschae, J., A robust PTAS for the parallel machine covering problem. In: LNCS, vol. 6346. pp. 36-47.
[11]
N. Bansal, M. Sviridenko, The santa claus problem, in: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC, 2006, pp. 31-40.
[12]
A. Asadpour, A. Saberi, An approximation algorithm for max-min fair allocation of indivisible goods, in: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, STOC, 2007, pp. 114-121.
- On-line machine covering on two machines with local migration
Recommendations
Optimal semi-online preemptive algorithms for machine covering on two uniform machines
In this paper, we consider the semi-online preemptive scheduling problem with decreasing job sizes on two uniform machines. Our goal is to maximize the continuous period of time (starting from time zero) when both machines are busy, which is equivalent ...
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
We study the on-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs. In this model, jobs arrive over time and jobs from different families cannot be scheduled in a common batch. We provide a best possible ...
An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
We study an on-line single parallel-batch machine scheduling problem where each job has a processing time and a delivery time. Jobs arrive over time and the batch capacity is unbounded. Jobs can be processed in a common batch, and each job is delivered ...
Comments
Information & Contributors
Information
Published In
Copyright © Elsevier Ltd © 2011.
Publisher
Pergamon Press, Inc.
United States
Publication History
Published: 01 September 2011
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 04 Jan 2025