A Framework for Scheduling with Online Availability

  • Florian Diedrich
  • Ulrich M. Schwarz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4641)


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.


Completion Time Competitive Ratio Online Algorithm Precedence Constraint Identical Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Ullman, J.D.: NP-complete scheduling problems. J. Comput. Syst. Sci. 10(3), 384–393 (1975)zbMATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    Sanlaville, E.: Nearly on line scheduling of preemptive independent tasks. Discrete Applied Mathematics 57(2-3), 229–241 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Albers, S., Schmidt, G.: Scheduling with unexpected machine breakdowns. Discrete Applied Mathematics 110(2-3), 85–99 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Liu, Z., Sanlaville, E.: Preemptive scheduling with variable profile, precedence constraints and due dates. Discrete Applied Mathematics 58(3), 253–280 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 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
  6. 6.
    Shmoys, D.B., Wein, J., Williamson, D.P.: Scheduling parallel machines on-line. SIAM J. Comput. 24(6), 1313–1331 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Sanlaville, E., Schmidt, G.: Machine scheduling with availability constraints. Acta Informatica 35(9), 795–811 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 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
  9. 9.
    McNaughton, R.: Scheduling with deadlines and loss functions. Mgt. Science 6, 1–12 (1959)zbMATHMathSciNetGoogle Scholar
  10. 10.
    Kawaguchi, T., Kyan, S.: Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM Journal on Computation 15(4), 1119–1129 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Prasanna, G.N.S., Musicus, B.R.: The optimal control approach to generalized multiprocesor scheduling. Algorithmica 15, 17–49 (1996)zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Florian Diedrich
    • 1
  • Ulrich M. Schwarz
    • 1
  1. 1.Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Olshausenstr. 40, 24098 KielGermany

Personalised recommendations