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

Saved in:
Bibliographic Details
Title: An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints.
Authors: Zhang, Wenda1, wzhang95@illinois.edu, Sauppe, Jason J.2, jsauppe@uwlax.edu, Jacobson, Sheldon H.3, shj@illinois.edu
Source: INFORMS Journal on Computing; Summer2021, Vol. 33 Issue 3, p1091-1102, 12p
Database: Applied Science & Technology Source
Description
ISSN:10919856
DOI:10.1287/ijoc.2020.0988