Skip to main content
SpringerLink
Log in

Semi-on-line scheduling problems for maximizing the minimum machine completion time

  • Published:
Acta Mathematicae Applicatae Sinica Aims and scope Submit manuscript

Abstract

This paper investigates several different semi-on-line two-machine scheduling problems for maximizing the minimum machine completion time. For each problem, we propose a best possible algorithm.

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. M.R. Garey, D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, 1978

    Google Scholar 

  2. D.K. Friesen, B.L. Deuermeryer. Analysis of Greedy Solutions for a Replacement Part Sequencing Problem.Math. Oper. Res., 1981, 6: 74–87

    Article  MATH  MathSciNet  Google Scholar 

  3. B.L. Deuermeryer, D.K. Friesen, M.A. Langston. Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System.SIAM J. Algorithms Discrete Methods, 1982, 3: 190–196

    Google Scholar 

  4. J. Csirik, H. Kellerer, G. Woeginger. The Exact LPT-bound for Maximizing the Minimum Completion Time.Oper. Res. Letters, 1992, 11: 281–287

    Article  MATH  MathSciNet  Google Scholar 

  5. G. Woeginger. A Polynomial Time Approximation Scheme for Maximizing the Minimum Machine Completion Time.Oper. Res. Letters, 1997, 20: 149–154

    Article  MATH  MathSciNet  Google Scholar 

  6. Y. Azar, L. Epstein. On-line Machine Covering. Algorithms-ESA'97, Lecture Notes in Computer Science 1284, Springer-Verlag, Austria, 1997, 23–36

    Google Scholar 

  7. R.L. Graham. Bounds for Certain Multiprocessor Anomalies.Bell System Technical Journal, 1966, 45: 1563–1581

    Google Scholar 

  8. U. Faigle, W. Kern, G. Turán. On the Performance of On-line Algorithm for Particular Problems.Acta Cybernetica, 1989, 9: 107–119

    MATH  MathSciNet  Google Scholar 

  9. Y. He, G. C. Zhang. Semi On-line Scheduling on Two Identical Machines.Computing, 1999, 62: 179–187

    Article  MATH  MathSciNet  Google Scholar 

  10. W.P. Liu, J.B. Sidney, A. van Vliet. Ordinal Algorithms for Parallel Machine Scheduling.Oper. Res. Letters, 1996, 18: 223–232

    Article  MATH  Google Scholar 

  11. H. Kellerer, V. Kotov, M.G. Speranza, Z. Tuza. Semi-on-Line Algorithms for the Partition Problem.Oper. Res. Letters, 1997, 21: 235–242

    Article  MATH  MathSciNet  Google Scholar 

  12. G. Zhang. A Simple Semi-on-line Algorithm forP2∥C max with a Buffer.Information Processing Letters, 1997, 61: 145–148

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    He Yong

Authors
  1. He Yong
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research is supported by the National Natural Science Foundation of China (No.19701028).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yong, H. Semi-on-line scheduling problems for maximizing the minimum machine completion time. Acta Mathematicae Applicatae Sinica 17, 107–113 (2001). https://doi.org/10.1007/BF02669690

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation