APA (7th ed.) Citation

Zhang, A., Zhang, L., Chen, Y., Chen, G., & Wang, X. (2023). Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints. Theoretical computer science, 941, 167-179. https://doi.org/10.1016/j.tcs.2022.11.012

Chicago Style (17th ed.) Citation

Zhang, An, Liang Zhang, Yong Chen, Guangting Chen, and Xing Wang. "Complexity and Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints." Theoretical Computer Science 941 (2023): 167-179. https://doi.org/10.1016/j.tcs.2022.11.012.

MLA (9th ed.) Citation

Zhang, An, et al. "Complexity and Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints." Theoretical Computer Science, vol. 941, 2023, pp. 167-179, https://doi.org/10.1016/j.tcs.2022.11.012.