APA (7th ed.) Citation

Lee, J., & Kim, Y. (2015). A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint. The Journal of the Operational Research Society, 66(9), 1542-1554. https://doi.org/10.1057/jors.2014.122

Chicago Style (17th ed.) Citation

Lee, Ju-Yong, and Yeong-Dae Kim. "A Branch and Bound Algorithm to Minimize Total Tardiness of Jobs in a Two Identical-parallel-machine Scheduling Problem with a Machine Availability Constraint." The Journal of the Operational Research Society 66, no. 9 (2015): 1542-1554. https://doi.org/10.1057/jors.2014.122.

MLA (9th ed.) Citation

Lee, Ju-Yong, and Yeong-Dae Kim. "A Branch and Bound Algorithm to Minimize Total Tardiness of Jobs in a Two Identical-parallel-machine Scheduling Problem with a Machine Availability Constraint." The Journal of the Operational Research Society, vol. 66, no. 9, 2015, pp. 1542-1554, https://doi.org/10.1057/jors.2014.122.