Skip to main content
SpringerLink
Log in

Linear Time Algorithms for Parallel Machine Scheduling

  • ORIGINAL ARTICLES
  • Published:
Acta Mathematica Sinica, English Series Aims and scope Submit manuscript

Abstract

This paper addresses linear time algorithms for parallel machine scheduling problems. We introduce a kind of threshold algorithms and discuss their main features. Three linear time threshold algorithm classes DT, PT and DTm are studied thoroughly. For all classes, we study their best possible algorithms among each class. We also present their application to several scheduling problems. The new algorithms are better than classical algorithms in time complexity and/or worst-case ratio. Computer-aided proof technique is used in the proof of main results, which greatly simplifies the proof and decreases case by case analysis.

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. Graham, R. L.: Bounds for certain multiprocessor anomalies. Bell Systems Technical Journal, 45, 1563–1581 (1966)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Coffman, E. G., Garey, M. R., Johnson, D. S.: An application of bin-packing to multiprocessor scheduling. SIAM Journal on Computing, 7, 1–17 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  4. Hochbaum, D. S., Shmoys, E. L.: Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM, 34, 144–162 (1987)

    Article  MathSciNet  Google Scholar 

  5. Hochbaum, D. S., Shmoys, E. L.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM Journal on Computing, 17, 539–551 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  6. He, Y., Kellerer, H., Kotov, V.: Linear compound algorithms for the partitioning problem. Naval Research Logistics, 47, 593–601 (2000)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. He, Y., Zhou, H., Jiang, Y. W.: Preemptive Semi-online Algorithms for Parallel Machine Scheduling with Known Total Size. Acta Mathematica Sinica, English Series, 22, 587–594 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. He, Y., Jiang, Y. W., Zhou, H.: Optimal preemptive online algorithm for scheduling with known largest size on two uniform machines. Acta Mathematica Sinica, English Series, 22(6), (2006)

  11. Tan, Z. Y., He, Y.: Semi-on-line problems on two identical machines with combined partial information. Operations Research Letters, 30, 408–414 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  12. Burkard, R. E., He, Y., Kellerer, H.: A linear compound algorithm for uniform machine scheduling. Computing, 61, 1–9 (1998)

    MathSciNet  MATH  Google Scholar 

  13. He, Y., Yang, Q. F., Tan, Z. Y., Yao, E. Y.: Algorithms for semi on-line multiprocessor scheduling. Journal of Zhejiang University Science, 3, 60–64 (2002)

    Article  Google Scholar 

  14. Seiden, S., Sgall, J., Woeginger, G.: Semi-online scheduling with decreasing job sizes. Operations Research Letters, 27, 215–227 (2000)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, State Key Lab of CAD & CG, Zhejiang University, Hangzhou 310027, P. R. China

    Zhi Yi Tan

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

    Yong He

Authors
  1. Zhi Yi 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

Corresponding authors

Correspondence to Zhi Yi Tan or Yong He.

Additional information

Supported by the National Natural Science Foundation of China (10301028, 60021201). A preliminary version of this paper appeared in the proceedings of the 1st International Conference on Algorithmic Applications in Management, Lecture Notes in Computer Science 3521

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tan, Z.Y., He, Y. Linear Time Algorithms for Parallel Machine Scheduling. Acta Math Sinica 23, 137–146 (2007). https://doi.org/10.1007/s10114-005-0838-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10114-005-0838-4

Keywords

MR (2000) Subject Classification

Search

Navigation