Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs.
C.-C. HeChin-Chia WuW.-C. LeePublished in: J. Oper. Res. Soc. (2009)
Keyphrases
- branch and bound
- search algorithm
- deteriorating jobs
- branch and bound algorithm
- lower bound
- search space
- release times
- column generation
- upper bound
- optimal solution
- beam search
- tree search
- branch and bound method
- single machine scheduling problem
- single machine
- branch and bound procedure
- combinatorial optimization
- heuristic search
- search tree
- max sat
- search strategy
- tabu search
- maximum lateness
- scheduling problem
- bnb adopt
- search problems
- branch and bound search
- state space
- np hard
- cost function