Author:
Fu Hao,Yu Ce,Sun Jizhou,Wang Mengmeng,Du Jun
Publisher
Springer International Publishing
Reference21 articles.
1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-Completeness. WH Freeman & Co., San Francisco (1979)
2. Kohler, W.H., Steiglitz, K.: Characterization and theoretical comparison of branch-and-bound algorithms for permutation problems. J. ACM (JACM) 21(1), 140–156 (1974)
3. Bruno, J., Coffman Jr., E.G., Sethi, R.: Scheduling independent tasks to reduce mean finishing time. Commun. ACM 17(7), 382–387 (1974)
4. Gonzalez Jr., Mario, J.: Deterministic processor scheduling. ACM Comput. Surv. (CSUR) 9(3), 173–204 (1977)
5. Hu, T.C.: Parallel sequencing and assembly line problems. Oper. Res. 9(6), 841–848 (1961)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献