Skip to main content
SpringerLink
Log in

Semi On-Line Scheduling on Two Identical Machines

  • Published:
Computing Aims and scope Submit manuscript

Abstract.

This paper investigates two different semi on-line scheduling problems on a two-machine system. In the first case, we assume that all jobs have their processing times in between p and rp \((p>0, r\geq1)\). In the second case, we assume that the largest processing time is known in advance. We show that one has a best possible algorithm with worst case ratio 4/3 while LS is still the best possible for the other problem with ratio \((r+1)/2\) which is still \(3/2\) in the worst case \(r=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

Author information

Authors and Affiliations

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

    Y. He

  2. Institute of Mathematics, Zhejiang University, Hangzhou 310027, P. R. China, e-mail: zgc@math.zju.edu.cn , , , , , , CN

    G. Zhang

Authors
  1. Y. He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: February 23, 1998; revised August 5, 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

He, Y., Zhang, G. Semi On-Line Scheduling on Two Identical Machines. Computing 62, 179–187 (1999). https://doi.org/10.1007/s006070050020

Download citation

  • Issue Date:

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

Search

Navigation