Skip to main content
SpringerLink
Log in

Semi-Online Algorithms for Scheduling with Machine Cost

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

Abstract

In this paper, we consider the following semi-online List Model problem with known total size. We are given a sequence of independent jobs with positive sizes, which must be assigned to be processed on machines. No machines are initially provided, and when a job is revealed the algorithm has the option to purchase new machines. By normalizing all job sizes and machine cost, we assume that the cost of purchasing one machine is 1. We further know the total size of all jobs in advance. The objective is to minimize the sum of the makespan and the number of machines to be purchased. Both non-preemptive and preemptive versions are considered. For the non-preemptive version, we present a new lower bound 6/5 which improves the known lower bound 1.161. For the preemptive version, we present an optimal semi-online algorithm with a competitive ratio of 1 in the case that the total size is not greater than 4, and an algorithm with a competitive ratio of 5/4 otherwise, while a lower bound 1.0957 is also presented for general case.

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. In Proc. RANDOM-APPROX’99, Berkley, USA, Lecture Notes in Computer Science, 1999, 1671: 168–176.

  2. Dósa G, He Y. Better on-line algorithms for scheduling with machine cost. SIAM J. Computing, 2004, 33: 1035–1051.

    Article  MATH  Google Scholar 

  3. Jiang Y, He Y. Preemptive online algorithms for scheduling with machine cost. Acta Informatica, 2005, 41: 315–340.

    Article  MathSciNet  MATH  Google Scholar 

  4. He Y, Cai S. Semi-online scheduling with machine cost. Journal of Computer Science and Technology, 2002, 17: 781–787.

    MathSciNet  MATH  Google Scholar 

  5. Cai S, He Y. Quasi-online algorithms for scheduling non-increasing processing jobs with processor cost. Acta Automatica Sinica, 2003, 29: 917–921. (in Chinese)

    MathSciNet  Google Scholar 

  6. Graham R L. Bounds on multiprocessing finishing anomalies. SIAM Journal on Applied Mathematics, 1969, 17(4): 416–429.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Kellerer H, Kotov V, Speranza M R, Tuza Z. Semi on-line algorithms for the partition problem. Operations Research Letters, 1997, 21: 235–242.

    Article  MathSciNet  MATH  Google Scholar 

  9. Dósa G, He Y. Semi-online algorithms for parallel machine scheduling problems. Computing, 2004, 72: 355–363.

    Article  MathSciNet  MATH  Google Scholar 

  10. Epstein L. Bin stretching revisited. Acta Informatica, 2003, 39: 97–117.

    Article  MathSciNet  MATH  Google Scholar 

  11. He Y, Jiang Y. Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines. Acta Informatica, 2004, 40: 367–383.

    Article  MathSciNet  MATH  Google Scholar 

  12. Seiden S. A guessing game and randomized online algorithms. In Proc. the 32nd Annual ACM Symposium on the Theory of Computing, ACM, New York, 2000, pp.592–601.

  13. McNaughton R. Scheduling with deadlines and loss functions. Management Sciences, 1959, 6: 1–12.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Science, Zhejiang Sci-Tech University, Hangzhou, 310018, P.R. China

    Yi-Wei Jiang

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

    Yi-Wei Jiang & Yong He

Authors
  1. Yi-Wei Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yong He
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yi-Wei Jiang.

Additional information

Research supported by the Natural Science Foundation of Zhejiang Province (Grant No. Y605316), and Natural Science Foundation of Education Department of Zhejiang Province (Grant No. 20060578).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jiang, YW., He, Y. Semi-Online Algorithms for Scheduling with Machine Cost. J Comput Sci Technol 21, 984–988 (2006). https://doi.org/10.1007/s11390-006-0984-x

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-006-0984-x

Keywords

Search

Navigation