Allahverdi, A., Aydilek, H., & Aydilek, A. (2020). No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan. Applied mathematics and computation, 365, 124688. https://doi.org/10.1016/j.amc.2019.124688
Citácia podle Chicago (17th ed.)Allahverdi, Ali, Harun Aydilek, a Asiye Aydilek. "No-wait Flowshop Scheduling Problem with Separate Setup Times to Minimize Total Tardiness Subject to Makespan." Applied Mathematics and Computation 365 (2020): 124688. https://doi.org/10.1016/j.amc.2019.124688.
Citácia podľa MLA (8th ed.)Allahverdi, Ali, et al. "No-wait Flowshop Scheduling Problem with Separate Setup Times to Minimize Total Tardiness Subject to Makespan." Applied Mathematics and Computation, vol. 365, 2020, p. 124688, https://doi.org/10.1016/j.amc.2019.124688.