A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags.
Gwo-Ji SheenLu-Wen LiaoPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- branch and bound algorithm
- scheduling problem
- flowshop
- strongly np hard
- np hard
- precedence constraints
- sequence dependent setup times
- single machine scheduling problem
- lower bound
- dominance rules
- branch and bound
- parallel machines
- upper bound
- minimizing makespan
- unrelated parallel machines
- single machine
- lower bounding
- maximum lateness
- optimal solution
- setup times
- special case
- release dates
- processing times
- combinatorial optimization
- randomly generated problems
- lagrangian relaxation
- tabu search
- integer programming
- upper bounding
- maximum clique
- branch and bound method
- shortest processing time
- approximation algorithms
- linear programming
- variable ordering
- knapsack problem
- search algorithm
- completion times
- single server
- computational complexity