Li, Q., Pan, Q., Gao, L., Sang, H., Zhang, X., & Li, W. (2024). The constrained permutation flowshop problem: An effective two-stage iterated greedy algorithm to minimize weighted tardiness. Swarm and evolutionary computation, 91, 101696. https://doi.org/10.1016/j.swevo.2024.101696
Citace podle Chicago (17th ed.)Li, Qiu-Ying, Quan-Ke Pan, Liang Gao, Hong-Yan Sang, Xian-Xia Zhang, a Wei-Min Li. "The Constrained Permutation Flowshop Problem: An Effective Two-stage Iterated Greedy Algorithm to Minimize Weighted Tardiness." Swarm and Evolutionary Computation 91 (2024): 101696. https://doi.org/10.1016/j.swevo.2024.101696.
Citace podle MLA (9th ed.)Li, Qiu-Ying, et al. "The Constrained Permutation Flowshop Problem: An Effective Two-stage Iterated Greedy Algorithm to Minimize Weighted Tardiness." Swarm and Evolutionary Computation, vol. 91, 2024, p. 101696, https://doi.org/10.1016/j.swevo.2024.101696.