Skip to main content
SpringerLink
Log in

Optimal semi-online algorithm for scheduling with rejection on two uniform machines

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

In this paper we consider a semi-online scheduling problem with rejection on two uniform machines with speed 1 and s≥1, respectively. A sequence of independent jobs are given and each job is characterized by its size (processing time) and its penalty, in the sense that, jobs arrive one by one and can be either rejected by paying a certain penalty or assigned to some machine. No preemption is allowed. The objective is to minimize the sum of the makespan of schedule, which is yielded by all accepted jobs and the total penalties of all rejected ones. Further, two rejection strategies are permitted thus an algorithm can propose two different schemes, from which the better solution is chosen. For the above version, we present an optimal semi-online algorithm H that achieves a competitive ratio ρ H (s) as a piecewise function in terms of the speed ratio s.

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

  • Bartal Y, Leonardi S, Marchetti-Sapaccamela A, Sgall J, Stougie L (2001) Multiprocessor scheduling with rejection. SIAM J Discrete Math 13:64–78

    Article  Google Scholar 

  • Dósa G, He Y (2006) Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines. Computing 76:149–164

    Article  MathSciNet  MATH  Google Scholar 

  • Epstein L, Sgall J (2004) Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithmica 39:43–57

    Article  MathSciNet  MATH  Google Scholar 

  • Epstein L, Noga J, Seiden SS, Sgall J, Woeginger GJ (2000) Randomized on-line scheduling on two related machines. J Scheduling 4:71–92

    Article  MathSciNet  Google Scholar 

  • Hoogeveen H, Skutella M, Woeginger GJ (2003) Preemptive scheduling with rejection. Math Prog Ser B 94:361–374

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  • He Y, Zhang G (1999) Semi on-line scheduling on two identical machines. Computing 62:179–187

    Article  MathSciNet  MATH  Google Scholar 

  • He Y, Yang QF, Tan ZY (2003a) Semi on-line scheduling on parallel machines (I). Appl Math J Chinese Univ A 18:105–114

    MathSciNet  MATH  Google Scholar 

  • He Y, Yang QF, Tan ZY (2003b) Semi on-line scheduling on parallel machines (II). Appl Math J Chinese Univ A 18:213–222

    MathSciNet  MATH  Google Scholar 

  • Kellerer H, Kotov V, Speranza M, Tuza Z (1997) Semi on-line algorithms for the partition problem. Oper Res Lett 21:235–242

    Article  MathSciNet  MATH  Google Scholar 

  • Min X, Kong XQ (2009) Semi on-line scheduling on two identical machines with rejection. OR Trans 35(5):1–9

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Information Engineering, Jiaxing College, Jiaxing, 314001, People’s Republic of China

    Xiao Min, Jing Liu & Yuqing Wang

Authors
  1. Xiao Min
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jing Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuqing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jing Liu.

Additional information

The first author is supported by The Outstanding Youth Teachers Foundation of Zhejiang Province, China (70609011).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Min, X., Liu, J. & Wang, Y. Optimal semi-online algorithm for scheduling with rejection on two uniform machines. J Comb Optim 22, 674–683 (2011). https://doi.org/10.1007/s10878-010-9316-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-010-9316-8

Keywords

Search

Navigation