A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem.
Ali TozkapanÖmer KircaChia-Shin ChungPublished in: Comput. Oper. Res. (2003)
Keyphrases
- scheduling problem
- branch and bound algorithm
- np hard
- precedence constraints
- lower bound
- flowshop
- dominance rules
- single machine
- optimal solution
- branch and bound
- strongly np hard
- upper bound
- single machine scheduling problem
- lower bounding
- setup times
- completion times
- permutation flowshop
- upper bounding
- randomly generated problems
- parallel machines
- processing times
- approximation algorithms
- combinatorial optimization
- tabu search
- special case
- finding an optimal solution
- sequence dependent setup times
- lagrangian relaxation
- maximum clique
- branch and bound method
- variable ordering
- mixed integer linear programming
- linear programming
- weighted sum
- genetic algorithm
- maximum lateness
- knapsack problem
- integer programming
- max sat
- computational complexity
- shortest processing time