Mao, J., Pan, Q., Miao, Z., & Gao, L. (2021). An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance. Expert systems with applications, 169, 114495. https://doi.org/10.1016/j.eswa.2020.114495
Citácia podle Chicago (17th ed.)Mao, Jia-yang, Quan-ke Pan, Zhong-hua Miao, a Liang Gao. "An Effective Multi-start Iterated Greedy Algorithm to Minimize Makespan for the Distributed Permutation Flowshop Scheduling Problem with Preventive Maintenance." Expert Systems with Applications 169 (2021): 114495. https://doi.org/10.1016/j.eswa.2020.114495.
Citácia podľa MLA (8th ed.)Mao, Jia-yang, et al. "An Effective Multi-start Iterated Greedy Algorithm to Minimize Makespan for the Distributed Permutation Flowshop Scheduling Problem with Preventive Maintenance." Expert Systems with Applications, vol. 169, 2021, p. 114495, https://doi.org/10.1016/j.eswa.2020.114495.