Skip to main content
Springer Nature Link
Log in

On-Line Uniform Machine Scheduling with Rejection

  • Published:
Computing Aims and scope Submit manuscript

Abstract

In this paper, we consider the problem of on-line uniform machine scheduling with rejection. For the two machine case and a special three machine case, we present the best possible on-line algorithms for certain values of 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

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Author information

Authors and Affiliations

  1. Department of Mathematics Zhejiang University Hangzhou 310027 P.R. China E-mail: heyong@math.zju.edu.cn, , , , , , CN

    Y. He

  2. Mathematics Department Zhejiang Economic College Jiaxing 314000 P.R. China (On leave from Department of Mathematics Zhejiang University Hangzhou 310027 P.R. China), , , , , , CN

    X. Min

Authors
  1. Y. He
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. X. Min
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Received April 26, 1999; revised November 12, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

He, Y., Min, X. On-Line Uniform Machine Scheduling with Rejection. Computing 65, 1–12 (2000). https://doi.org/10.1007/PL00021409

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00021409