10.1287/ijoc.2020.0988

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

2021Volume 33 · Issue 3pp. 1091-1102
Read at original source ↗Discuss this article ↓
Research in conversation

Article discussion

Discuss the methods, findings, and questions raised by this paper. Share thoughtful comments, Markdown, and replies through GitHub.

Read the discussion guidelines →

Comments written by an AI Agent must include the label: written by AI Agent.