Skip to main content
SpringerLink
Log in

Ordinal On-Line Scheduling on Two Uniform Machines

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1858))

Included in the following conference series:

  • 424 Accesses

Abstract

We investigate the ordinal on-line scheduling problem on two uniform machines. We present a comprehensive lower bound of any ordinal algorithm, which constitutes a piecewise function of machine speed ratio s ≥ 1. We further propose an algorithm whose competitive ratio matches the lower bound for most of s ∈ (1,∞). The total length of the intervals of s where the competitive ratio does not match the lower bound is less than 0:7784 and the biggest gap never exceeds 0:0521.

This research is supported by National Natural Science Foundation of China (grant number: 19701028) and 973 National Fundamental Research Project of China (Information Technology and High-Performance Software).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agnetis, A.: No-wait flow shop scheduling with large lot size. Rap 16.89, Dipartimento di Informatica e Sistemistica, Universita Degli Studi di Roma “La Sapienza”, Rome, Italy, 1989.

    Google Scholar 

  2. Azar, Y., Regev, O.: Online bin stretching. Proc. of RANDOM’98, 71–82 (1998).

    Google Scholar 

  3. Cho, Y., Sahni, S.: Bounds for list scheduling on uniform processors. SIAM J. Computing 9, 91–103 (1980).

    Article  MATH  MathSciNet  Google Scholar 

  4. Epstein, L., Noga, J., Seiden, S. S., Sgall, J., Woeginger, G.J.: Randomized online scheduling for two related machines. Proc. of the 10th ACM-SIAM Symp. on Discrete Algorithms, 317–326 (1999).

    Google Scholar 

  5. He, Y., Zhang, G.: Semi on-line scheduling on two identical machines. Computing, 62, 179–197 (1999).

    Article  MATH  MathSciNet  Google Scholar 

  6. Kellerer, H., Kotov, V., Speranza, M., Tuza, Z.: Semi online algorithms for partition problem. Oper. Res. Letters, 21, 235–242 (1997).

    Article  MATH  MathSciNet  Google Scholar 

  7. Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, Toronto, 1976.

    MATH  Google Scholar 

  8. Liu, W. P., Sidney, J. B., Van Vliet, A.: Ordinal algorithms for parallel machine scheduling. Oper. Res. Letters, 18, 223–232 (1996).

    Article  MATH  Google Scholar 

  9. Liu, W. P., Sidney, J.B.: Bin packing using semi-ordinal data. Oper. Res. Letters, 19, 101–104 (1996).

    Article  MATH  MathSciNet  Google Scholar 

  10. Seiden, S., Sgall, J., Woeginger, G.: Semi-online scheduling with decreasing job sizes. Technical Report, TU Graz, Austria, 1999.

    Google Scholar 

  11. Sleator, D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of ACM 28, 202–208 (1985).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Zhiyi Tan & Yong He

Authors
  1. Zhiyi Tan
    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

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Minnesota, MN 55455, Minneapolis, USA

    Ding-Zhu Du

  2. Department of Computer Science and Software Engineering, University of Newcastle, Callaghan, NSW 2308, Australia

    Peter Eades  & Vladimir Estivill-Castro  & 

  3. School of Computer Science and Engineering, University of Newcastle, NSW 2052, Sydney, Australia

    Xuemin Lin  & Arun Sharma  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tan, Z., He, Y. (2000). Ordinal On-Line Scheduling on Two Uniform Machines. In: Du, DZ., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds) Computing and Combinatorics. COCOON 2000. Lecture Notes in Computer Science, vol 1858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44968-X_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-44968-X_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67787-1

  • Online ISBN: 978-3-540-44968-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation