An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints.
Wenda ZhangJason J. SauppeSheldon H. JacobsonPublished in: INFORMS J. Comput. (2021)
Keyphrases
- precedence constraints
- branch and bound algorithm
- scheduling problem
- sequence dependent setup times
- flowshop
- np hard
- parallel machines
- strongly np hard
- lower bound
- setup times
- single machine scheduling problem
- precedence relations
- release dates
- maximum lateness
- branch and bound
- identical machines
- single machine
- vertex cover
- optimal solution
- lower bounding
- upper bound
- combinatorial optimization
- tabu search
- processing times
- total tardiness
- lagrangian relaxation
- evolutionary algorithm
- search algorithm
- shortest processing time
- upper bounding
- computational complexity
- special case
- objective function
- dynamic programming
- finding an optimal solution
- completion times