论文信息 - Scheduling Tree-Structured Tasks with Restricted Execution Times

Scheduling Tree-Structured Tasks with Restricted Execution Times

Abstract In this article we show that scheduling a tree-structured task system with two execution times in order to minimize the schedule length is strongly NP-hard for an arbitrary number of processors. If the execution times are powers of some integer r >1, then the problem is NP-hard even for two processors.

Joseph Y.-T. Leung | Jianzhong Du | J. Leung | J. Du

[1] Joseph Y.-T. Leung,et al. On Scheduling Independent Tasks with Restricted Execution Times , 1982, Oper. Res..

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] Jeffrey D. Ullman,et al. NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[4] Edward G. Coffman,et al. Computer and job-shop scheduling theory , 1976 .

[5] T. C. Hu. Parallel Sequencing and Assembly Line Problems , 1961 .

[6] Edward G. Coffman,et al. Bin packing with divisible item sizes , 1987, J. Complex..