Fairness-Free Periodic Scheduling with Vacations

  • Jiří Sgall
  • Hadas Shachnai
  • Tami Tamir
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3669)


We consider a problem of repeatedly scheduling n jobs on m parallel machines. Each job is associated with a profit, gained each time the job is completed, and the goal is to maximize the average profit per time unit. Once the processing of a job is completed, it goes on vacation and returns to the system, ready to be processed again, only after its vacation is over. This problem has many applications, in production planning, machine maintenance, media-on-demand and databases query processing, among others.

We show that the problem is NP-hard already for jobs with unit processing times and unit profits, and develop approximation algorithms, as well as optimal algorithms for certain subclasses of instances. In particular, we show that a preemptive greedy algorithm achieves a ratio of 2 to the optimal for instances with arbitrary processing times and arbitrary profits. For the special case of unit processing times, we present a 1.67-approximation algorithm for instances with arbitrary profits, and a 1.39-approximation algorithm for instances where all jobs have the same (unit) profits. For the latter case, we also show that when the load generated by an instance is sufficiently large (in terms of n and m), any algorithm that uses no intended idle times yields an optimal schedule.


Schedule Problem Time Slot Optimal Schedule Periodic Schedule Preemptive Schedule 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Anily, S., Bramel, J.: Periodic scheduling with service constraints. Operations Research 48, 635–645 (2000)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Aydin, H., Melhem, R., Mosse, D., Mejia-Alvarez, P.: Optimal Reward-Based Scheduling of Periodic Real-Time Tasks. In: 20th IEEE Real-Time Systems Symp. (1999)Google Scholar
  3. 3.
    Bar-Noy, A., Bhatia, R., Naor, J., Schieber, B.: Minimizing Service and Operation Costs of Periodic Scheduling. In: Proc. of SODA (1998)Google Scholar
  4. 4.
    Bar-Noy, A., Ladner, R.E.: Windows Scheduling Problems for Broadcast Systems. In: Proc. of SODA (2002)Google Scholar
  5. 5.
    Bar-Noy, A., Ladner, R.E., Tamir, T.: Windows Scheduling as a Restricted Version of Bin Packing. In: Proc. of SODA (2004)Google Scholar
  6. 6.
    Bar-Noy, A., Ladner, R.E., Tamir, T.: A General Buffer Scheme for the Windows Scheduling Problem. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 139–151. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  7. 7.
    Baruah, S.K., Cohen, N.K., Plaxton, C.G., Varvel, D.A.: Proportionate Progress: A Notion of Fairness in Resource Allocation. Algorithmica 15(6), 600–625 (1996)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Baruah, S.K., Lin, S.-S.: Pfair Scheduling of Generalized Pinwheel Task Systems. IEEE Trans. on Comp. 47, 812–816 (1998)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Chung, J., Liu, J.W.S., Lin, K.: Scheduling Periodic Jobs that Allow Imprecise Results. IEEE Trans. on Comp. 39(9), 1156–1174 (1990)CrossRefGoogle Scholar
  10. 10.
    Karp, R.M.: A Characterization of the Minimum Cycle Mean in a Digraph. Discrete Math. 23, 309–311 (1978)MATHMathSciNetGoogle Scholar
  11. 11.
    Lenstra, H.W.: Integer programming with a fixed number of variables. Mathematics of Operations Research 8, 538–548 (1983)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM 20(1), 46–61 (1973)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Tijdeman, R.: The Chairman assignment Problem. Discrete Mathematics 32, 323–330 (1980)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jiří Sgall
    • 1
    • 2
  • Hadas Shachnai
    • 3
  • Tami Tamir
    • 4
  1. 1.Mathematical Institute, AS CRPraha 1Czech Republic
  2. 2.Dept. of Applied Mathematics, Faculty of Mathematics and PhysicsCharles UniversityPraha
  3. 3.Computer Science DepartmentThe TechnionHaifaIsrael
  4. 4.School of Computer scienceThe Interdisciplinary CenterHerzliyaIsrael

Personalised recommendations