A linear time algorithm to schedule trees with communication delays optimally on two machines
暂无分享,去创建一个
[1] David S. Johnson,et al. Scheduling Opposing Forests , 1983 .
[2] Shirley Dex,et al. JR 旅客販売総合システム(マルス)における運用及び管理について , 1991 .
[3] Jeffrey D. Ullman,et al. NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..
[4] Christophe Picouleau. Etude de problemes d'optimisation dans les systemes distribues , 1992 .
[5] P. Chrétienne. A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints , 1989 .
[6] T. C. Hu. Parallel Sequencing and Assembly Line Problems , 1961 .
[7] Frank D. Anger,et al. Scheduling with Sufficient Loosely Coupled Processors , 1990, J. Parallel Distributed Comput..
[8] B. J. Lageweg,et al. Multiprocessor scheduling with communication delays , 1990, Parallel Comput..
[9] Mihalis Yannakakis,et al. Scheduling Interval-Ordered Tasks , 1979, SIAM J. Comput..