A Branch and Bound Algorithm for a Single-machine Scheduling Problem with Positive, Negative Time-lags.
Peter BruckerThomas HilbigJohann L. HurinkPublished in: Discret. Appl. Math. (1999)
Keyphrases
- single machine scheduling problem
- branch and bound algorithm
- lower bound
- branch and bound
- release dates
- np hard
- sequence dependent setup times
- precedence constraints
- upper bound
- combinatorial optimization
- optimal solution
- lagrangian relaxation
- setup times
- maximum lateness
- completion times
- resource consumption
- query execution
- search procedure
- np complete
- response time
- dynamic programming
- search space
- search algorithm