An improved branch-and-bound algorithm for the one-machine scheduling problem with delayed precedence constraints
Year of publication: |
2021
|
---|---|
Authors: | Zhang, Wenda ; Sauppe, Jason J. ; Jacobson, Sheldon H. |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 3, p. 1091-1102
|
Subject: | combinatorial optimization | one-machine scheduling | branch and bound | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound | Operations Research | Operations research | Mathematische Optimierung | Mathematical programming |
-
Morrison, David Robert, (2014)
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
-
A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Coniglio, Stefano, (2021)
- More ...
-
Zhang, Wenda, (2021)
-
A network simplex algorithm for the equal flow problem on a generalized network
Morrison, David Robert, (2013)
-
A wide branching strategy for the graph coloring problem
Morrison, David Robert, (2014)
- More ...