A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling : A mixed graph coloring approach.
Ahmed KouiderHacène Aït HaddadènePublished in: Comput. Oper. Res. (2021)
Keyphrases
- branch and bound algorithm
- graph coloring
- job shop scheduling
- bi objective
- combinatorial optimization problems
- combinatorial optimization
- efficient solutions
- optimal solution
- shortest path problem
- job shop scheduling problem
- branch and bound
- combinatorial problems
- lower bound
- scheduling problem
- multi objective
- np hard
- knapsack problem
- test problems
- ant colony optimization
- nsga ii
- multi objective optimization
- upper bound
- max sat
- multiple objectives
- network design
- metaheuristic
- optimization problems
- traveling salesman problem
- objective function
- evolutionary algorithm
- simulated annealing
- resource constraints
- routing problem
- optimization algorithm
- phase transition
- tabu search
- search space
- artificial neural networks