Author:
Chen Rongjun,Huang Wanzhen,Men Zhongxian,Tang Guochun
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference18 articles.
1. Adiri, I., & Aizikowitz, N. (1989). Open-shop scheduling problems with dominated machines. Naval Research Logistics, 36(3), 273–281.
2. Barany, I., & Fiala, T. (1982). Nearly optimum solution of multimachine scheduling problems (in Hungarian). Szigma, 15(3), 177–191.
3. Brucker, P., Hurink, J., Jurisch, B., & Wostmann, B. (1997). A branch & bound algorithm for the open-shop problem. Discrete Applied Mathematics, 76, 43–59.
4. Chen, B., & Strusevich, V. A. (1993). Approximation algorithms for three machine open shop scheduling. ORSA Journal on Computing, 5, 321–328.
5. Chen, B., & Yu, W. (2001). How good is a Dense Shop Schedule? Acta Mathematics Application Sinica, 17(1), 121–128.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献