APA (7th ed.) Citation

Tong, W., Xu, Y., & Zhang, H. (2022). A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint. Theoretical computer science, 922, 438-446. https://doi.org/10.1016/j.tcs.2022.04.044

Chicago Style (17th ed.) Citation

Tong, Weitian, Yao Xu, and Huili Zhang. "A Polynomial-time Approximation Scheme for Parallel Two-stage Flowshops Under Makespan Constraint." Theoretical Computer Science 922 (2022): 438-446. https://doi.org/10.1016/j.tcs.2022.04.044.

MLA (9th ed.) Citation

Tong, Weitian, et al. "A Polynomial-time Approximation Scheme for Parallel Two-stage Flowshops Under Makespan Constraint." Theoretical Computer Science, vol. 922, 2022, pp. 438-446, https://doi.org/10.1016/j.tcs.2022.04.044.