APA (7th ed.) Citation

Fernandez-Viagas, V., & Framinan, J. M. (2015). Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness. Computers & operations research, 64, 86-96. https://doi.org/10.1016/j.cor.2015.05.006

Chicago Style (17th ed.) Citation

Fernandez-Viagas, Victor, and Jose M. Framinan. "Efficient Non-population-based Algorithms for the Permutation Flowshop Scheduling Problem with Makespan Minimisation Subject to a Maximum Tardiness." Computers & Operations Research 64 (2015): 86-96. https://doi.org/10.1016/j.cor.2015.05.006.

MLA (9th ed.) Citation

Fernandez-Viagas, Victor, and Jose M. Framinan. "Efficient Non-population-based Algorithms for the Permutation Flowshop Scheduling Problem with Makespan Minimisation Subject to a Maximum Tardiness." Computers & Operations Research, vol. 64, 2015, pp. 86-96, https://doi.org/10.1016/j.cor.2015.05.006.