Skip to main content
SpringerLink
Log in

Semi-online scheduling with machine cost

  • Correspondence
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

For most scheduling problems the set of machines is fixed initially and remains unchanged for the duration of the problem. Recently Imreh and Nogaproposed to add the concept of machine cost to scheduling problems and considered the so-calledList Model problem. An online algorithm with a competitive ratio 1.618 was given while the lower bound is 4/3. In this paper, two different semi-online versions of this problem are studied. In the first case, it is assumed that the processing time of the largest job is knowna priori. A semi-online algorithm is presented with the competitive ratio at most 1.5309 while the lower bound is 4/3. In the second case, it is assumed that the total processing time of all jobs is known in advance. A semi-online algorithm is presented with the competitive ratio at most 1.414 while the lower bound is 1.161. It is shown that the additional partial available information about the jobs leads to the possibility of constructing a schedule with a smaller competitive ratio than that of online algorithms.

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. Imreh C, Noga J. Scheduling with machine cost. InProc. ESA’99, Lecture Notes in Computer Science, Springer-Verlag, 1999, pp.168–176.

  2. Liu W P, Sidney J B, van Vliet A. Ordinal algorithms for parallel machine schedulin..Oper. Res. Letters, 1996, 18: 223–232.

    Article  MATH  Google Scholar 

  3. Tan Z Y, He Y. Semi-online scheduling with ordinal data on two uniform machines.Oper. Res. Letters, 2001, 28(5): 221–231.

    Article  MATH  MathSciNet  Google Scholar 

  4. Azar Y, Regev O. Online bin stretching. InProc. RANDOM’98, Lecture Notes in Computer Science, Springer-Verlag, 1998, pp.71–82.

  5. Seiden S, Sgall J, Woeginger G. Semi-online scheduling with decreasing job sizes.Oper. Res. Letters, 2000, 27: 215–221.

    Article  MathSciNet  Google Scholar 

  6. Kellerer H, Kotov V, Speranza M, Tuza Z. Semi-online algorithms forthe partition problem.Oper. Res. Letter,, 1997, 21: 235–242.

    Article  MATH  MathSciNet  Google Scholar 

  7. He Y, Zhang G. Semi-online scheduling on two identical machines.Computing, 1999, 62: 179–187.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Zhejiang University, 310027, Hangzhou, P.R. China

    He Yong

  2. Department of Mathematics, Wenzhou Teachers’ College, 325000, Wenzhou, P.R. China

    Cai Shengyi

Authors
  1. He Yong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cai Shengyi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to He Yong.

Additional information

This research is supported by the National NKBRSF of China on “Applld Theory and High Performance Softwore for IT” (Grant No. 1998030401(2)), TRAPOYT, and the National Natural Science Foundation of China (Grant No.19701028).

HE Yong received his B.S., M.S., and Ph.D. degrees from Zhejiang University in 1989, 1992, 1996, respectively. He is currently a professor at the Department of Mathematics, Zhejiang University. His current research interests include combinatorial and network optimization, onlne algorithms, mathematical modeling, etc.

CAI Shengyi got his B.S. degree from Beijing Normal University in 1997. He is currently an M.S. student of Zhejiang University and an assistant professor at the Department of Mathematics, Wenzhou Teachers’ College. His current interests include scheduling and online algorithms.

Rights and permissions

Reprints and permissions

About this article

Cite this article

He, Y., Cai, S. Semi-online scheduling with machine cost. J. Compt. Sci. & Technol. 17, 781–787 (2002). https://doi.org/10.1007/BF02960768

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation