A Framework for Scheduling with Online Availability
With the increasing popularity of large-scale distributed computing networks,a new aspect has to be considered for scheduling problems: machines may not be available permanently, but may be withdrawn and reappear later.We give several results for completion time based objectives: 1. we show that scheduling independent jobs on identical machines with online failures to minimize the sum of completion times is (8/7 − ε)-inapproximable, 2. we give a nontrivial sufficient condition on machine failure under which the SRPT (shortest remaining processing time) heuristic yields optimal results for this setting, and 3. we present meta-algorithms that convert approximation algorithms for offline scheduling problems with completion time based objective on identical machines to approximation algorithms for the corresponding preemptive online problem on identical machines with discrete or continuous time. Interestingly, the expected approximation rate becomes worse by a factor that only depends on the probability of unavailability.
KeywordsCompletion Time Competitive Ratio Online Algorithm Precedence Constraint Identical Machine
Unable to display preview. Download preview PDF.
- 5.Hall, L.A., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: Off-line and on-line algorithms. In: Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 142–151. ACM Press, New York (1996)Google Scholar
- 8.Afrati, F.N., Bampis, E., Chekuri, C., Karger, D.R., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation schemes for minimizing average weighted completion time with release dates. In: Proceedings of FOCS 1999, pp. 32–44 (1999)Google Scholar