Author:
Chen Bo,Ye Yinyu,Zhang Jiawei
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference9 articles.
1. Chen, B., “A better heuristic for preemptive parallel machine scheduling with setup times,” SIAM Journal on Computing, 22(6), 1303–1318 (1993).
2. Garey, M. R. and D. S. Johnson, “Strong NP-completeness results: Motivation, examples and implications,” Journal of the Association for Computing Machinery, 25, 499–508 (1978).
3. Garey, M. R. and D. S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness,” Freeman, San Francisco, 1979.
4. Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling: A survey,” Annals of Operations Research, 5, 287–326 (1979).
5. Monma, C. L. and C. N. Potts, “Analysis of heuristics for preemptive parallel machine scheduling with batch setup times,” Operations Research, 41(5), 981–993 (1993).
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献