Fu, B., Huo, Y., & Zhao, H. (2023). Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity. Theoretical computer science, 961, 113937. https://doi.org/10.1016/j.tcs.2023.113937
Chicago Style (17th ed.) CitationFu, Bin, Yumei Huo, and Hairong Zhao. "Streaming Approximation Scheme for Minimizing Total Completion Time on Parallel Machines Subject to Varying Processing Capacity." Theoretical Computer Science 961 (2023): 113937. https://doi.org/10.1016/j.tcs.2023.113937.
MLA (9th ed.) CitationFu, Bin, et al. "Streaming Approximation Scheme for Minimizing Total Completion Time on Parallel Machines Subject to Varying Processing Capacity." Theoretical Computer Science, vol. 961, 2023, p. 113937, https://doi.org/10.1016/j.tcs.2023.113937.