A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services.
Onur OzturkMehmet A. BegenGregory S. ZaricPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- branch and bound
- makespan minimization
- combinatorial optimization
- metaheuristic
- optimal solution
- branch and bound procedure
- search algorithm
- job shop scheduling problem
- branch and bound algorithm
- branch and bound method
- lagrangian relaxation
- tree search algorithm
- total weighted tardiness
- branch and bound search
- lower bound
- tree search
- lagrangian heuristic
- search space
- column generation
- tabu search
- upper bound
- processing times
- simulated annealing
- scheduling problem
- parallel machines
- search strategies
- linear programming relaxation
- single machine
- polynomially solvable
- special case
- combinatorial optimization problems
- setup times
- np hard
- ant colony optimization
- flowshop
- feasible solution
- traveling salesman problem
- genetic algorithm
- vehicle routing problem
- objective function
- polynomial time approximation
- search tree
- benchmark problems
- knapsack problem
- neural network
- linear programming
- bnb adopt