A framework for scheduling with online availability

Authors:
Florian Diedrich;Ulrich M. Schwarz
Affiliations:
Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Kiel, Germany;Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Kiel, Germany
Venue:
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Year:
2007

Citing 8
Cited 2

Worst case bound of an LRF schedule for the mean weighted flow-time problem

SIAM Journal on Computing
Preemptive scheduling with variable profile, precedence constraints and due dates

Discrete Applied Mathematics
Nearly on line scheduling of preemptive independent tasks

Discrete Applied Mathematics - Special issue: Combinatorial Optimization 1992 (CO92)
Scheduling Parallel Machines On-line

SIAM Journal on Computing
Scheduling to minimize average completion time: off-line and on-line algorithms

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Scheduling with unexpected machine breakdowns

Discrete Applied Mathematics
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
NP-complete scheduling problems

Journal of Computer and System Sciences

A Survey on Approximation Algorithms for Scheduling with Machine Unavailability

Algorithmics of Large and Complex Networks
Minimizing total weighted completion time with an unexpected machine unavailable interval

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.