Publisher
Springer Science and Business Media LLC
Reference4 articles.
1. D.S. Johnson: Near-Optimal Bin-Packing Algorithms. Doctoral thesis, M.I.T., Cambridge, Mass., 1973.
2. B.S. Baker: A New Proof for the First-Fit Decreasing Bin-Packing Algorithm,J. Algorithms,6 (1985), 49–70.
3. E.G. Coffman Jr., M.R. Garey and D.S. Johnson: An Application of Bin-Packing to Multiprocessor Scheduling,SIAM J. Comput,7 (1987), 1–17.
4. Minyi Yue: On the Exact Upper Bound for the Multifit Processor Scheduling Algorithm,Operations Research in China (ed. Minyi Yue), 233–260,Ann. Oper. Res.,24 (1990).
Cited by
115 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献