APA (7th ed.) Citation

Yuan, Y., Lan, Y., Ding, N., & Han, X. (2022). A PTAS for non-resumable open shop scheduling with an availability constraint. Journal of combinatorial optimization, 43(2), 350-362. https://doi.org/10.1007/s10878-021-00773-7

Chicago Style (17th ed.) Citation

Yuan, Yuan, Yan Lan, Ning Ding, and Xin Han. "A PTAS for Non-resumable Open Shop Scheduling with an Availability Constraint." Journal of Combinatorial Optimization 43, no. 2 (2022): 350-362. https://doi.org/10.1007/s10878-021-00773-7.

MLA (9th ed.) Citation

Yuan, Yuan, et al. "A PTAS for Non-resumable Open Shop Scheduling with an Availability Constraint." Journal of Combinatorial Optimization, vol. 43, no. 2, 2022, pp. 350-362, https://doi.org/10.1007/s10878-021-00773-7.