Skip to main content
SpringerLink
Log in

Scheduling with Rejection and Non-Identical Job Arrivals

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

Abstract

In this paper, we address the scheduling problem with rejection and non-identical job arrivals, in which we may choose not to process certain jobs and each rejected job incurs a penalty. Our goal is to minimize the sum of the total penalties of the rejected jobs and the maximum completion time of the processed ones. For the off-line variant, we prove its NP-hardness and present a PTAS, and for the on-line special case with two job arrivals, we design a best possible algorithm with competitive ratio \(\frac{(\sqrt{5}+1)}{2}\).

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. Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, and L. Stougie, Multiprocessor scheduling with rejection, SIAM Journal of Discrete Maths, 2000, 13(1): 64–78.

    Article  Google Scholar 

  2. Y. He and X. Min, On-line uniform machine scheduling with rejection, Computing, 2000, 65(1): 1–12.

    Google Scholar 

  3. H. Hoogeveen, M. Skutella, and G. J. Woeginger, Preemptive scheduling with rejection, Lecture Notes in Computer Science, 2000, 1879: 268–277.

    Google Scholar 

  4. S. S. Seiden, Preemptive multiprocessor scheduling with rejection, Theoretical Computer Science, 2001, 262(1): 437–458.

    Article  Google Scholar 

  5. D. W. Engels, D. R. Karger, S. G. Kolliopoulos, S. Sengupta, R. N. Uma, and J. Wein, Techniques for scheduling with rejection. Lecture Notes in Computer Science, 1998, 1461: 490–501.

    Article  Google Scholar 

  6. L. Epstein, J. Noga, and G. J. Woeginger, On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Operations Research Letters, 2002, 30(6): 415–420.

    Article  Google Scholar 

  7. S. Sengupta, Algorithms and approximation schemes for mimimum lateness/tardiness scheduling with rejection, Lecture Notes in Computer Science, 2003, 2748: 79–90.

    Article  Google Scholar 

  8. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling, Annals of Discrete Mathematics, 1979, 5: 287–326.

    Google Scholar 

  9. G.J. Woeginger, When does a dynamic programming formulation guarantee the exitence of an FPTAS? INFORMS Journal on Computing, 2000, 12(1): 57–74.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Systems Science, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100080, China

    Zhigang Cao

  2. School of Operations Research and Management Science, Qufu Normal University, Rizhao, Shandong, 276826, China

    Zhigang Cao & Yuzhong Zhang

Authors
  1. Zhigang Cao
    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 Zhigang Cao.

Additional information

The research is supported by National Natural Science Fundation of China under Grant NO. 10671108 and Province Natural Science Foundation of Shandong under Grant NO. Y2005A04.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cao, Z., Zhang, Y. Scheduling with Rejection and Non-Identical Job Arrivals. Jrl Syst Sci & Complex 20, 529–535 (2007). https://doi.org/10.1007/s11424-007-9050-1

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-007-9050-1

Keywords

Search

Navigation