Author:
Koulamas Christos,Kyparisis George J.
Subject
Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference6 articles.
1. Alon, N., Azar, Y., Woeginger, G.J., Yadid, T., 1997. Approximation schemes for scheduling. In: Proceedings of the 8th Symposium on Discrete Algorithms, pp. 493–500.
2. Worst-case analysis of a placement algorithm related to storage allocation;Chandra;SIAM Journal of Computing,1975
3. Bounds on multiprocessing timing anomalies;Graham;SIAM Journal of Applied Mathematics,1969
4. Linear compound algorithms for the partitioning problem;He;Naval Research Logistics,2000
5. Tighter bounds on a heuristic for a partition problem;Leung;Information Processing Letters,1995
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献