A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals.
Shiqing YaoZhibin JiangNa LiPublished in: Comput. Oper. Res. (2012)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- batch processing
- lower bounding
- optimal solution
- randomly generated problems
- upper bound
- combinatorial optimization
- upper bounding
- np hard
- test problems
- variable ordering
- strongly np hard
- precedence constraints
- single machine scheduling problem
- single machine
- lower and upper bounds
- tabu search
- neural network
- finding an optimal solution
- arrival processes
- similarity measure