A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints.
Moon-Won ParkYeong-Dae KimPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- branch and bound algorithm
- precedence constraints
- scheduling problem
- np hard
- lower bound
- branch and bound
- sequence dependent setup times
- optimal solution
- setup times
- single machine scheduling problem
- dominance rules
- lower bounding
- strongly np hard
- upper bound
- combinatorial optimization
- integer variables
- single machine
- release dates
- approximation algorithms
- flowshop
- maximum lateness
- randomly generated problems
- global constraints
- lower and upper bounds
- lagrangian relaxation
- mixed integer linear programming
- finding an optimal solution
- parallel machines
- processing times
- process planning
- production cost
- knapsack problem
- branch and bound method
- maximum clique
- special case
- upper bounding
- search algorithm
- printed circuit boards
- max sat
- constraint satisfaction
- constraint satisfaction problems
- evolutionary algorithm