Skip to main content
SpringerLink
Log in

On-Line Scheduling of Unit Time Jobs with Rejection on Uniform Machines

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

The authors consider the problem of on-line scheduling of unit execution time jobs on uniform machines with rejection penalty. The jobs arrive one by one and can be either accepted and scheduled, or be rejected. The objective is to minimize the total completion time of the accepted jobs and the total penalty of the rejection jobs. The authors propose an on-line algorithm and prove that the competitive ratio is \(\frac{1}{2}(2+\sqrt{3})\approx 1.86602\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Sleator and R. E. Tarjan, Amortized efficiency of list update and paging rule, Communications of ACM, 1985, 28: 202–208.

    Article  Google Scholar 

  2. D. W. Engels, S. G. Kolliopoulous, S. Sengupta, R. N. Uma, and J. Wein, Techniques for scheduling with rejection, in Proceedings of the 6th European Symposium on Algorithm (ESA’1998), Lecture Notes in Computer Science, 1998, 1461: 490–501.

  3. Leah Epstein, Join Noga, and J. Gerhard Woeginger, On-line scheduling of unit time with rejection: minimizing the total completion time, Operations Research Letters, 2002, 30: 415–420.

    Article  Google Scholar 

  4. H. Hoogeveen, M. Skutella, and G. J. Woeginger, Preemptive scheduling with rejection, in Proceedings of the 8th European Symposium on Algorithms (ESA’2000), Lecture Notes in Computer Science, 2000, 1879: 268–277.

  5. Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, and L. Stougie, Multiprocess or scheduling with rejection, SIAM J. Discrete Math, 2000, 13: 64–78.

    Article  Google Scholar 

  6. S. S. Seiden, Preemptive multiprocessor scheduling with rejection, Theoret. Comput. Sci., 2001, 262: 437–458.

    Article  Google Scholar 

  7. X. T. Deng, H. D. Feng, P. X. Zhang, Y. Z. Zhang, and Z. Hong, Minimizing mean completion time in a batch processing system, Algorithmica, 2004, 38(4): 513–528.

    Article  Google Scholar 

  8. X. T. Deng, C. K. Poon, and Y. Z. Zhang, Approximation algorithms in batch processing, J. Comb. Optim., 2003, 7(3): 247–257.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Binzhou Medical University, Yantai, 264003, China

    Shoupeng Liu

  2. Institute of Operations Research, Qufu Normal University, Rizhao, 276826, China

    Yuzhong Zhang

Authors
  1. Shoupeng Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuzhong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shoupeng Liu.

Additional information

The research is supported by the National Natural Science Foundation of China under Grant No. 10671108.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, S., Zhang, Y. On-Line Scheduling of Unit Time Jobs with Rejection on Uniform Machines. J. Syst. Sci. Complex. 21, 114–118 (2008). https://doi.org/10.1007/s11424-008-9070-5

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-008-9070-5

Keywords

Search

Navigation