Lee, K., Choi, B., Leung, J. Y., & Pinedo, M. L. (2009). Approximation algorithms for multi-agent scheduling to minimize total weighted completion time. Information processing letters, 109(16), 913-917. https://doi.org/10.1016/j.ipl.2009.04.018
Citácia podle Chicago (17th ed.)Lee, Kangbok, Byung-Cheon Choi, Joseph Y.-T Leung, a Michael L. Pinedo. "Approximation Algorithms for Multi-agent Scheduling to Minimize Total Weighted Completion Time." Information Processing Letters 109, no. 16 (2009): 913-917. https://doi.org/10.1016/j.ipl.2009.04.018.
Citácia podľa MLA (8th ed.)Lee, Kangbok, et al. "Approximation Algorithms for Multi-agent Scheduling to Minimize Total Weighted Completion Time." Information Processing Letters, vol. 109, no. 16, 2009, pp. 913-917, https://doi.org/10.1016/j.ipl.2009.04.018.