Journal of Scheduling

, Volume 15, Issue 5, pp 653–664 | Cite as

Online scheduling of bounded length jobs to maximize throughput

  • Christoph Dürr
  • Łukasz Jeż
  • Nguyen Kim Thang
Open Access


We consider an online scheduling problem, motivated by the issues present at the joints of networks using ATM and TCP/IP. Namely, IP packets have to be broken down into small ATM cells and sent out before their deadlines, but cells corresponding to different packets can be interwoven. More formally, we consider the online scheduling problem with preemptions, where each job j is revealed at release time r j , and has processing time p j , deadline d j , and weight w j . A preempted job can be resumed at any time. The goal is to maximize the total weight of all jobs completed on time. Our main results are as follows. Firstly, we prove that when the processing times of all jobs are at most k, the optimum deterministic competitive ratio is Θ(k/log k). Secondly, we give a deterministic algorithm with competitive ratio depending on the ratio between the smallest and the largest processing time of all jobs. In particular, it attains competitive ratio 5 in the case when all jobs have identical processing times, for which we give a lower bound of 2.598. The latter upper bound also yields an O(log k)-competitive randomized algorithm for the variant with processing times bounded by k.


Online scheduling Preemption with resume Competitive analysis Online algorithms 


  1. Awerbuch, B., Bartal, Y., Fiat, A., & Rosén, A. (1994). Competitive non-preemptive call control. In Proc. 5th symp. on discrete algorithms (pp. 312–320). Google Scholar
  2. Baptiste, P. (1999). An O(n 4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Operations Research Letters, 24(4), 175–180. CrossRefGoogle Scholar
  3. Baptiste, P., Chrobak, M., Dürr, C., Jawor, W., & Vakhania, N. (2004). Preemptive scheduling of equal-length jobs to maximize weighted throughput. Operations Research Letters, 32(3), 258–264. CrossRefGoogle Scholar
  4. Baruah, S., Haritsa, J., & Sharma, N. (1994). On-line scheduling to maximize task completions. In Real-time systems symposium (pp. 228–236). CrossRefGoogle Scholar
  5. Canetti, R., & Irani, S. (1998). Bounding the power of preemption in randomized scheduling. SIAM Journal on Computing, 27(4), 993–1015. CrossRefGoogle Scholar
  6. Chan, W. T., Lam, T. W., Ting, H. F., & Wong, P. W. H. (2004). New results on on-demand broadcasting with deadline via job scheduling with cancellation. In Proc. 10th international computing and combinatorics conference (pp. 210–218). Google Scholar
  7. Chen, B., Potts, C. N., & Woeginger, G. J. (1998). A review of machine scheduling: complexity, algorithms and approximability. In Handbook of combinatorial optimization (Vol. 3, pp. 21–169). Dordrecht: Kluwer Academic. Google Scholar
  8. Chrobak, M., Jawor, W., Sgall, J., & Tichý, T. (2007). Online scheduling of equal-length jobs: randomization and restarts help. SIAM Journal on Computing, 36(6), 1709–1728. CrossRefGoogle Scholar
  9. Englert, M., & Westermann, M. (2007). Considering suppressed packets improves buffer management in QoS switches. In Proc. 18th symp. on discrete algorithms (SODA) (pp. 209–218). Google Scholar
  10. Hajek, B. (2001). On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time. In Proceedings of conference on information sciences and systems (CISS) (pp. 434–438). Google Scholar
  11. Kalyanasundaram, B., & Pruhs, K. (2000). Speed is as powerful as clairvoyance. Journal of the ACM, 47(4), 617–643. CrossRefGoogle Scholar
  12. Kalyanasundaram, B., & Pruhs, K. (2003). Maximizing job completions online. Journal of Algorithms, 49(1), 63–85. CrossRefGoogle Scholar
  13. Lawler, E.L. (1994). Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the “tower of sets” property. Mathematical and Computer Modelling, 20(2), 91–106. CrossRefGoogle Scholar
  14. Ting, H. F. (2008). A near optimal scheduler for on-demand data broadcasts. Theoretical Computer Science, 401(1–3), 77–84. CrossRefGoogle Scholar
  15. Vakhania, N. (2008). A fast on-line algorithm for the preemptive scheduling of equal-length jobs on a single processor. In Proceedings of the 2nd WSEAS international conference on computer engineering and applications (pp. 158–161). Google Scholar

Copyright information

© The Author(s) 2011

Authors and Affiliations

  • Christoph Dürr
    • 1
  • Łukasz Jeż
    • 2
  • Nguyen Kim Thang
    • 3
  1. 1.CNRS, LIP6Université Pierre et Marie CurieParisFrance
  2. 2.Institute of Computer ScienceUniversity of WrocławWrocławPoland
  3. 3.LamsadeUniversité Paris-DauphineParisFrance

Personalised recommendations