Cite
A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops.
MLA
Gong, Mingyang, et al. “A Polynomial-Time Approximation Scheme for an Arbitrary Number of Parallel Identical Multi-Stage Flow-Shops.” Annals of Operations Research, vol. 335, no. 1, Apr. 2024, pp. 185–204. EBSCOhost, https://doi.org/10.1007/s10479-024-05860-6.
APA
Gong, M., Lin, G., Miyano, E., Su, B., & Tong, W. (2024). A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops. Annals of Operations Research, 335(1), 185–204. https://doi.org/10.1007/s10479-024-05860-6
Chicago
Gong, Mingyang, Guohui Lin, Eiji Miyano, Bing Su, and Weitian Tong. 2024. “A Polynomial-Time Approximation Scheme for an Arbitrary Number of Parallel Identical Multi-Stage Flow-Shops.” Annals of Operations Research 335 (1): 185–204. doi:10.1007/s10479-024-05860-6.