Author:
Alkaya Ali Fuat,Topcuoglu Haluk Rahmi
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Software
Reference37 articles.
1. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness (W. H. Freeman and Co., 1979).
2. J.D. Ullman, NP-complete scheduling problems, Journal of Computer and Systems Sciences 10 (1975) 384–393.
3. T.C. Hu, Parallel sequencing and assembly line problems, Operational Research 9(6)(1961) 841–848.
4. E.G. Coffman, Computer and Job-Shop Scheduling Theory (John Wiley and Sons, 1976).
5. M. Wu and D. Gajski, Hypertool: A programming aid for message passing systems, IEEE Transactions on Parallel and Distributed Systems 1 (July 1990) 330–343.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献