A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment.
Kripa ShankerBimal K. ModiPublished in: Eur. J. Oper. Res. (1999)
Keyphrases
- branch and bound
- resource constrained
- scheduling problem
- search algorithm
- optimal solution
- branch and bound procedure
- combinatorial optimization
- beam search
- branch and bound method
- tree search
- tree search algorithm
- branch and bound search
- branch and bound algorithm
- lower bound
- tabu search
- np hard
- column generation
- lagrangian heuristic
- search space
- resource constraints
- sensor networks
- depth first search
- search strategies
- linear programming relaxation
- single machine
- upper bound
- real time
- wireless sensor networks
- metaheuristic
- feasible solution
- traveling salesman problem
- simulated annealing
- lagrangian relaxation
- multi agent
- cost effective
- lower and upper bounds
- linear programming
- multipath
- multi objective
- knapsack problem
- heuristic search
- end to end