An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints.

MLA

Zhang, Wenda, et al. “An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints.” INFORMS Journal on Computing, vol. 33, no. 3, Summer 2021, pp. 1091–102. EBSCOhost, https://doi.org/10.1287/ijoc.2020.0988.

APA

Zhang, W., Sauppe, J. J., & Jacobson, S. H. (2021). An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints. INFORMS Journal on Computing, 33(3), 1091–1102. https://doi.org/10.1287/ijoc.2020.0988

Chicago

Zhang, Wenda, Jason J. Sauppe, and Sheldon H. Jacobson. 2021. “An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints.” INFORMS Journal on Computing 33 (3): 1091–1102. doi:10.1287/ijoc.2020.0988.