Huo, Y., & Leung, J. Y. (2010). Fast approximation algorithms for job scheduling with processing set restrictions. Theoretical computer science, 411(44-46), 3947-3955. https://doi.org/10.1016/j.tcs.2010.08.008
Chicago-Zitierstil (17. Ausg.)Huo, Yumei, und Joseph Y.-T Leung. "Fast Approximation Algorithms for Job Scheduling with Processing Set Restrictions." Theoretical Computer Science 411, no. 44-46 (2010): 3947-3955. https://doi.org/10.1016/j.tcs.2010.08.008.
MLA-Zitierstil (9. Ausg.)Huo, Yumei, und Joseph Y.-T Leung. "Fast Approximation Algorithms for Job Scheduling with Processing Set Restrictions." Theoretical Computer Science, vol. 411, no. 44-46, 2010, pp. 3947-3955, https://doi.org/10.1016/j.tcs.2010.08.008.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.