Skip to main content
SpringerLink
Log in

Semi-online Machine Covering on Two Uniform Machines with Known Total Size

  • Published:
Computing Aims and scope Submit manuscript

Abstract

This paper investigates semi-online scheduling problem with known total size on two uniform machines for maximizing the minimum machine completion time. Lower bounds and optimal algorithms for every s≥1 are given, where s is the speed ratio of two machines. Both the overall competitive ratio and the competitive ratio for are strictly smaller than those of the optimal algorithms of the corresponding semi-online scheduling problem with known optimal value. It indicates that two related semi-online problems are different.

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.

Similar content being viewed by others

References

  • Y. Azar O. Regev (2001) ArticleTitleOnline bin-stretching Theor. Comput. Sci. 168 17–41 Occurrence Handle10.1016/S0304-3975(00)00258-9 Occurrence Handle1848614

    Article  MathSciNet  Google Scholar 

  • T. C. E. Cheng H. Kellerer V. Kotov (2005) ArticleTitleSemi-online multiprocessor scheduling with given total processing time Theor. Comput. Sci. 337 134–146 Occurrence Handle10.1016/j.tcs.2004.11.018 Occurrence Handle2141218

    Article  MathSciNet  Google Scholar 

  • L. Epstein (2005) ArticleTitleTight bounds for online bandwidth allocation on two links Discrete Appl. Math. 148 181–188 Occurrence Handle10.1016/j.dam.2005.02.002 Occurrence Handle2134121

    Article  MathSciNet  Google Scholar 

  • L. Epstein (2003) ArticleTitleBin stretching revisited Acta Informatica 39 97–117 Occurrence Handle10.1007/s00236-002-0102-7 Occurrence Handle1963123

    Article  MathSciNet  Google Scholar 

  • L. Epstein L. M. Favrholdt (2005) ArticleTitleOptimal non-preemptive semi-online scheduling on two related machines J. Algorithms 57 49–73 Occurrence Handle10.1016/j.jalgor.2004.11.002 Occurrence Handle2167168

    Article  MathSciNet  Google Scholar 

  • L. Epstein J. Noga S. Seiden J. Sgall G. Woeginer (2001) ArticleTitleRandomized online scheduling on two uniform machines J. Scheduling 4 71–92 Occurrence Handle10.1002/jos.60

    Article  Google Scholar 

  • Y. He G. C. Zhang (1999) ArticleTitleSemi online scheduling on two identical machines Computing 62 179–187 Occurrence Handle10.1007/s006070050020 Occurrence Handle1697851

    Article  MathSciNet  Google Scholar 

  • H. Kellerer V. Kotov M. R. Speranza Z. Tuza (1997) ArticleTitleSemi online algorithms for the partition problem Oper. Res. Lett. 21 235–242 Occurrence Handle10.1016/S0167-6377(98)00005-4 Occurrence Handle1628715

    Article  MathSciNet  Google Scholar 

  • S. Seiden J. Sgall G. Woeginger (2000) ArticleTitleSemi-online scheduling with decreasing job sizes Oper. Res. Lett. 27 215–227 Occurrence Handle10.1016/S0167-6377(00)00053-5 Occurrence Handle1807399

    Article  MathSciNet  Google Scholar 

  • Z. Y. Tan Y. He (2002) ArticleTitleSemi-online problems on two identical machines with combined partial information Oper. Res. Lett. 30 408–414 Occurrence Handle10.1016/S0167-6377(02)00164-5 Occurrence Handle1939744

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, State Key Lab of CAD & CG, Zhejiang University, Hangzhou, 310027, P. R. China

    Z. Y. Tan

  2. Department of Mathematics, Zhejiang Forestry University, Hangzhou, 311300, P. R. China

    S. J. Cao

Authors
  1. Z. Y. Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. J. Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Z. Y. Tan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tan, Z.Y., Cao, S.J. Semi-online Machine Covering on Two Uniform Machines with Known Total Size. Computing 78, 369–378 (2006). https://doi.org/10.1007/s00607-006-0187-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-006-0187-x

AMS Subject Classifications

Keywords

Search

Navigation