Advertisement

Abstract

This paper revisits the online problem of preemptive scheduling to minimize the total flow time. Previous theoretical results often assume that preemption is free, which is not true for most systems. This paper investigates the complexity of the problem when a processor has to perform a certain amount of overhead (extra work) before it resumes the execution of a job preempted before. Such overhead causes delay to all unfinished jobs. In this paper we first consider single-processor scheduling. We show that no online algorithm can be competitive for total flow time in the presence of preemption overhead (note that the well-known online algorithm SRPT is 1-competitive when preemption overhead is zero). We then consider resource augmentation and show a simple algorithm that is (1 + ε)-speed \((1+\frac{1}{\epsilon})\)-competitive for minimizing total flow time on a single processor. We also extend the result to the multiprocessor setting.

Keywords

Completion Time Competitive Ratio Online Algorithm Total Completion Time Competitive Algorithm 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187(3), 985–1032 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Avrahami, N., Azar, Y.: Minimizing total flow time and total completion time with immediate dispatching. Algorithmica 47(3), 253–268 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Bartal, Y., Leonardi, S., Shallom, G., Sitters, R.A.: On the Value of Preemption in Scheduling. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX and RANDOM 2006. LNCS, vol. 4110, pp. 39–48. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Chen, B.: A better heuristic for preemptive parallel machine scheduling with batch setup times. SIAM J. Comput. 22(6), 1303–1318 (1993)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Crauwels, H.A.J., Potts, C.N., Oudheusden, D.V., Wassenhove, L.N.V.: Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs. J. Scheduling 8(2), 161–177 (2005)zbMATHCrossRefGoogle Scholar
  6. 6.
    Divakaran, S., Saks, M.E.: Approximation algorithms for problems in scheduling with set-ups. Discrete Applied Mathematics 156(5), 719–729 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Divakaran, S., Saks, M.E.: An online algorithm for a problem in scheduling with set-ups and release times. Algorithmica 60(2), 301–315 (2011)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Fox, K., Moseley, B.: Online scheduling on identical machines using srpt. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, USA, January 23-25, pp. 120–128 (2011)Google Scholar
  9. 9.
    Hariri, A., Potts, C.: Single machine scheduling with batch set-up times to minimize maximum lateness. Annals of Operations Research 70, 75–92 (1997)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Heydari, M., Sadjadi, S., Mohammadi, E.: Minimizing total flow time subject to preemption penalties in online scheduling. The International Journal of Advanced Manufacturing Technology 47, 227–236 (2010), doi:10.1007/s00170-009-2190-9CrossRefGoogle Scholar
  11. 11.
    Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. J. Comput. Syst. Sci. 73(6), 875–891 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Liu, Z., Cheng, T.C.E.: Scheduling with job release dates, delivery times and preemption penalties. Inf. Process. Lett. 82(2), 107–111 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Liu, Z., Cheng, T.C.E.: Minimizing total completion time subject to job release dates and preemption penalties. J. Scheduling 7(4), 313–327 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Monma, C.L., Potts, C.N.: Analysis of heuristics for preemptive parallel machine scheduling with batch setup times. Oper. Res. 41, 981–993 (1993)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. Algorithmica 32(2), 163–200 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Schuurman, P., Woeginger, G.J.: Preemptive scheduling with job-dependent setup times. In: SODA, pp. 759–767 (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Ho-Leung Chan
    • 1
  • Tak-Wah Lam
    • 1
  • Rongbin Li
    • 1
  1. 1.The University of Hong KongHong Kong

Personalised recommendations