A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops.
Yeong-Dae KimPublished in: Comput. Oper. Res. (1993)
Keyphrases
- branch and bound algorithm
- single machine scheduling problem
- number of tardy jobs
- sequence dependent setup times
- total weighted tardiness
- flowshop
- completion times
- scheduling problem
- np hard
- minimizing makespan
- precedence constraints
- lower bound
- branch and bound
- release dates
- strongly np hard
- processing times
- upper bound
- optimal solution
- lower bounding
- combinatorial optimization
- lagrangian relaxation
- randomly generated problems
- setup times
- mixed integer linear programming
- upper bounding
- single machine
- parallel machines
- finding an optimal solution
- special case
- maximum lateness
- branch and bound method
- scheduling jobs
- max sat
- search space
- maximum clique
- shortest processing time
- variable ordering
- network design problem
- resource consumption
- approximation algorithms
- evolutionary algorithm
- search algorithm