A Meta-Heuristic Approach Based on the Genetic and Greedy Algorithms to Solving Flexible Job-Shop Scheduling Problem.
Amin RezaeipanahFariba SarhangniaMohammadJavad AbdollahiPublished in: Comput. Sci. (2021)
Keyphrases
- metaheuristic
- greedy algorithms
- combinatorial optimization
- greedy algorithm
- genetic algorithm
- simulated annealing
- tabu search
- optimization problems
- mip solver
- scatter search
- combinatorial optimization problems
- ant colony optimization
- job shop scheduling problem
- search space
- hybrid algorithms
- multi objective
- combinatorial problems
- knapsack problem
- guided local search
- suboptimal solutions
- vehicle routing problem
- iterated local search
- particle swarm optimization
- job shop scheduling
- traveling salesman problem
- optimization method
- harmony search
- harmony search algorithm
- branch and bound algorithm
- search algorithm
- optimal solution
- benchmark instances
- multi start
- branch and bound
- exact algorithms
- optimization algorithm
- mathematical programming
- worst case
- cost function
- meta heuristic algorithm