A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties.
Kamran KianfarGhasem MoslehiPublished in: Comput. Oper. Res. (2012)
Keyphrases
- branch and bound algorithm
- single machine scheduling problem
- precedence constraints
- lower bound
- deteriorating jobs
- branch and bound
- sequence dependent setup times
- upper bound
- completion times
- release dates
- np hard
- test problems
- lower bounding
- randomly generated problems
- mixed integer linear programming
- objective function
- optimal solution
- setup times
- combinatorial optimization
- lagrangian relaxation
- computational complexity
- max sat
- upper bounding
- finding an optimal solution
- maximum lateness
- processing times
- variable ordering
- scheduling problem
- branch and bound method
- maximum clique