3Lawler, E. L. and J. M. Moore. A functional equation and its application to resource allocation and sequencing problem[J] .Man. Sci., 1969,16:77 - 84.
4R.G.Vickson. Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine[ J ]. Operation Research, 1980,28:1155 - 1167.
5R.G. Vickson. Two single machine sequencing problems involving controllable job processing times [ J ] . AIIE Trans,1980,12:258 - 262.
6A. Janiak, M. Y. Kovalyov. Single machine schedulings ubject to deadlines and resource dependent processing times[J] . European Journal of Operational Research, 1996, 94:284- 291.
7R. L. Daniels,J. B. Mazzola. Flow shop scheduling with resource flexibility [ J ] . Operation Research, 1994,42: 504 -522.
8J. Turek, J. Wolf, and P. Yu. Approximate algorithms for scheduling parallelizable tasks [ C] . In 4th Annual ACM Symposium on Parallel Algorithms and Architectures,1992, 323- 332.
9W. Ludwig, P. Tiwari, Scheduling malleable and nonmalleable parallel tasks[C]. In proceedings of the Fifth Annual ACM- SIAM Symposium on Discrete Algorithms, 1994,167 - 176.
10G. Mouni_ e, C. Rapine, D. Trystram. Effcient Approximation Algorithms for Scheduling Malleable Tasks [ C] . In Proceedings of the Eleventh ACM Symposium on Parallel Algorithms and Architectures, 1999,23 - 32.
