1. Chen, S. P., He, Y. and Yao, E. Y., Three-partioning containing kernels: Complexity and heuristic, Computing, 1996, 57: 255–271.
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.
3. Garey, M. R. and Johnson, D. S., Computers and intractability: A guide to the theory of NP-Completeness, Freeman, San Francisco, 1979.
4. Lee, C. Y., Parallel machines scheduling with nonsimultaneous machine available times. Discrete Appl. Math., 1991, 30: 53–61.
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.