A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness.
Xiaochuan LuoChengbin ChuPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- single machine scheduling problem
- sequence dependent setup times
- branch and bound algorithm
- completion times
- total weighted tardiness
- single machine
- release dates
- lower bound
- maximum lateness
- branch and bound
- precedence constraints
- scheduling problem
- upper bound
- optimal solution
- np hard
- setup times
- processing times
- combinatorial optimization
- lagrangian relaxation
- strongly np hard
- search algorithm
- column generation
- shortest path
- dynamic programming