Author:
Blocher James D.,Sevastyanov Sergey
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference5 articles.
1. Chen, B. (1993). A note on LPT scheduling. Operations Research Letters, 14, 139–142.
2. Coffman, E. G., & Sethi, R. (1976). A generalized bound on LPT sequencing. Revue Francaise d’ Automatique Informatique, Recherche Operationnelle Supplement, 10, 17–25.
3. Garey, M. R., & Johnson, D. S. (1978). Strong NP-completeness results: Motivation, examples and implications. Journal of the Association for Computing Machinery, 25, 499–508.
4. Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17(2), 416–429.
5. Pinedo, M. (2012). Scheduling: Theory, algorithms and systems (4th ed.). New York, NY: Springer.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献