Advertisement

Journal of Computer Science and Technology

, Volume 17, Issue 6, pp 781–787 | Cite as

Semi-online scheduling with machine cost

  • He Yong 
  • Cai Shengyi 
Correspondence

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.

Keywords

analysis of algorithm competitive ratio semi-online scheduling machine cost 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Imreh C, Noga J. Scheduling with machine cost. InProc. ESA’99, Lecture Notes in Computer Science, Springer-Verlag, 1999, pp.168–176.Google Scholar
  2. [2]
    Liu W P, Sidney J B, van Vliet A. Ordinal algorithms for parallel machine schedulin..Oper. Res. Letters, 1996, 18: 223–232.MATHCrossRefGoogle Scholar
  3. [3]
    Tan Z Y, He Y. Semi-online scheduling with ordinal data on two uniform machines.Oper. Res. Letters, 2001, 28(5): 221–231.MATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    Azar Y, Regev O. Online bin stretching. InProc. RANDOM’98, Lecture Notes in Computer Science, Springer-Verlag, 1998, pp.71–82.Google Scholar
  5. [5]
    Seiden S, Sgall J, Woeginger G. Semi-online scheduling with decreasing job sizes.Oper. Res. Letters, 2000, 27: 215–221.CrossRefMathSciNetGoogle Scholar
  6. [6]
    Kellerer H, Kotov V, Speranza M, Tuza Z. Semi-online algorithms forthe partition problem.Oper. Res. Letter,, 1997, 21: 235–242.MATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    He Y, Zhang G. Semi-online scheduling on two identical machines.Computing, 1999, 62: 179–187.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 2002

Authors and Affiliations

  1. 1.Department of MathematicsZhejiang UniversityHangzhouP.R. China
  2. 2.Department of MathematicsWenzhou Teachers’ CollegeWenzhouP.R. China

Personalised recommendations