Hermelin, D., Karhi, S., Pinedo, M., & Shabtay, D. (2021). New algorithms for minimizing the weighted number of tardy jobs on a single machine. Annals of operations research, 298(1-2), 271-287. https://doi.org/10.1007/s10479-018-2852-9
Chicago Style (17th ed.) CitationHermelin, Danny, Shlomo Karhi, Michael Pinedo, and Dvir Shabtay. "New Algorithms for Minimizing the Weighted Number of Tardy Jobs on a Single Machine." Annals of Operations Research 298, no. 1-2 (2021): 271-287. https://doi.org/10.1007/s10479-018-2852-9.
MLA (9th ed.) CitationHermelin, Danny, et al. "New Algorithms for Minimizing the Weighted Number of Tardy Jobs on a Single Machine." Annals of Operations Research, vol. 298, no. 1-2, 2021, pp. 271-287, https://doi.org/10.1007/s10479-018-2852-9.