A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs.
C. T. NgJi-Bo WangT. C. Edwin ChengL. L. LiuPublished in: Comput. Oper. Res. (2010)
Keyphrases
- branch and bound algorithm
- deteriorating jobs
- combinatorial optimization
- single machine scheduling problem
- scheduling problem
- lower bound
- finding an optimal solution
- branch and bound
- variable ordering
- np hard
- precedence constraints
- upper bound
- optimal solution
- integer variables
- processing times
- single machine
- release times
- upper bounding
- weighted max sat
- max sat
- maximum lateness
- strongly np hard
- traveling salesman problem
- sequence dependent setup times
- exact solution
- simulated annealing
- metaheuristic
- exact methods
- setup times
- lagrangian relaxation
- column generation