Funder
Australian Research Council
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference34 articles.
1. Ageev, A. A. (2018). Inapproximately lower bounds for open shop problems with exact delays. Approximation and online algorithms (pp. 45–55). New York: Springer.
2. Ageev, A. A., & Baburin, A. E. (2007). Approximation algorithms for UET scheduling problems with exact delays. Operations Research Letters, 35(4), 533–540.
3. Ageev, A. A., & Kononov, A. V. (2007). Approximation algorithms for scheduling problems with exact delays. Approximation and online algorithms. Berlin: Springer.
4. Ahr, D., Békési, J., Galambos, G., Oswald, M., & Reinelt, G. (2004). An exact algorithm for scheduling identical coupled tasks. Mathematical Methods of Operations Research, 59(2), 193–203.
5. Azadeh, A., Farahani, M. H., Torabzadeh, S., & Baghersad, M. (2014). Scheduling prioritized patients in emergency department laboratories. Computer Methods and Programs in Biomedicine, 117(2), 61–70.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献