Chen, X., Liang, Y., Sterna, M., Wang, W., & Błażewicz, J. (2020). Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date. European journal of operational research, 284(1), 67-74. https://doi.org/10.1016/j.ejor.2019.12.003
Citácia podle Chicago (17th ed.)Chen, Xin, Yage Liang, Małgorzata Sterna, Wen Wang, a Jacek Błażewicz. "Fully Polynomial Time Approximation Scheme to Maximize Early Work on Parallel Machines with Common Due Date." European Journal of Operational Research 284, no. 1 (2020): 67-74. https://doi.org/10.1016/j.ejor.2019.12.003.
Citácia podľa MLA (8th ed.)Chen, Xin, et al. "Fully Polynomial Time Approximation Scheme to Maximize Early Work on Parallel Machines with Common Due Date." European Journal of Operational Research, vol. 284, no. 1, 2020, pp. 67-74, https://doi.org/10.1016/j.ejor.2019.12.003.