Skip to main content
SpringerLink
Log in

The multifit algorithm for set partitioning containing kernels

  • Published:
Applied Mathematics-A Journal of Chinese Universities Aims and scope Submit manuscript

Abstract

This paper investigates the set partitioning containing kernels. This problem can also be considered as the identical machine scheduling problem with nonsimultaneous machine release times. That the algorithm MULTIFIT has a worst case bound of 6/5 is proved. Through combining MULTIFIT and LPT, an algorithm MULTILPT with a worst case bound of 7/6 has been obtained.

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. Chen, S. P., He, Y. and Yao, E. Y., Three-partioning containing kernels: Complexity and heuristic, Computing, 1996, 57: 255–271.

    Article  MATH  Google Scholar 

  2. Yao, E. Y., Li, R. H. and He, Y., New progress on optimal partitioning problem, In: K. H. Phua, et al eds., Optimization Techniques and Applications, ICOTA'92, World Scientific, Singapore, 1992, 229–235.

    Google Scholar 

  3. Garey, M. R. and Johnson, D. S., Computers and intractability: A guide to the theory of NP-Completeness, Freeman, San Francisco, 1979.

    MATH  Google Scholar 

  4. Lee, C. Y., Parallel machines scheduling with nonsimultaneous machine available times. Discrete Appl. Math., 1991, 30: 53–61.

    Article  MATH  Google Scholar 

  5. Lin, G. H., He, Y., Lu, H. Y., et al., Exact bounds of the modified LPT algorithm applying to parallel machines scheduling with nonsimultaneous machine available time, Appl. Math.-JCU Ser. B, 1997, 12: 109–118.

    MATH  Google Scholar 

  6. He, Y., Kellerer, H. and Kotov, V., Linear compound algorithms for the partitioning problem, submitted for publication.

  7. Li, R. H., Multifit algorithm for parallel machine scheduling with nonsimultaneous machine available time, Manuscript, 1996.

  8. Chang, S. Y., Hwang, H., The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines, Manuscript, Pohang University of Science and Technology, South Korea, 1996.

    Google Scholar 

  9. Coffman, E. G., Garey, M. R. and Johnson, D. S., An application of bin packing to multiprocessor scheduling, SIAM J. Comput. 1978, 7: 1–17.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Appl. Math., Zhejiang Univ., 310027, Hangzhou

    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 Natural Science Foundation of China (19701028)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yong, H. The multifit algorithm for set partitioning containing kernels. Appl. Math. Chin. Univ. 14, 227–232 (1999). https://doi.org/10.1007/s11766-999-0029-7

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11766-999-0029-7

1991 MR Subject Classification

Keywords

Search

Navigation