A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness.
Xiaochuan LuoFeng ChuPublished in: Appl. Math. Comput. (2006)
Keyphrases
- sequence dependent setup times
- minimizing total tardiness
- branch and bound algorithm
- single machine scheduling problem
- single machine
- precedence constraints
- total weighted tardiness
- scheduling problem
- release dates
- np hard
- lower bound
- maximum lateness
- branch and bound
- optimal solution
- upper bound
- combinatorial optimization
- processing times
- setup times
- lagrangian relaxation
- search algorithm
- column generation
- hybrid algorithm
- multistage
- tabu search
- parallel machines
- integer programming
- solution quality
- completion times
- feasible solution
- linear programming
- dynamic programming