Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference13 articles.
1. Aksjonov, V. A. (1988). A polynomial-time algorithm of approximate solution of a scheduling problem. Upravlyaemye Sistemy, 28, 8–11. (in Russian).
2. Bárány, I., & Fiala, T. (1982). Nearly optimum solution of multimachine scheduling problems. Szigma, 15, 177–191. (in Hungarian).
3. Chen, B., & Strusevich, V. A. (1993). Approximation algorithms for three machine open shop scheduling. ORSA Journal on Computing, 5, 321–328.
4. Chen, B., & Yu, W. (2001). How good is a dense shop schedule? Acta Mathematics Application Sinica, 17(1), 121–128.
5. Chen, R., Huang, W., Men, Z., & Tang, G. (2012). Open-shop dense schedules: Properties and worst-case performance ratio. Journal of Scheduling, 15(1), 3–11.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献