Author:
Afrati F.,Bampis E.,Finta L.,Milis I.
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference21 articles.
1. Ali, H. and H. El-Rewini, ?The time complexity of scheduling interval orders with communication is polynomial? Parallel Processing Letters, 3(1), 53?58 (1993).
2. Bampis, E., A. Giannakos, and J.-C. Konig, ?On the complexity of scheduling with Large communication delays? Europ. Journal of Operational Research, 94, 252?260 (1996).
3. Chr�tienne, P. and C. Picouleau, ?Scheduling with communication delays: A survey? in P. Chr�tienne et al. (eds.), Scheduling Theory and Its Applications, J. Wiley, 1995.
4. Coffman Jr., E. G. and R. L. Graham, ?Optimal scheduling for two-processor systems,? Acta Informatica, 1, 200?213 (1972).
5. Jung, H., L. Kirousis, and P. Spirakis, ?Lower bounds and efficient algorithms for multiprocessor scheduling of DAGs with communication delays? Information and Computation, 105, 94?104 (1993).
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献