Mathematical programming and three metaheuristic algorithms for a bi-objective supply chain scheduling problem.
Hamid ZareiMorteza Rasti BarzokiPublished in: Neural Comput. Appl. (2019)
Keyphrases
- mathematical programming
- supply chain
- bi objective
- metaheuristic algorithms
- ant colony optimization
- scheduling problem
- metaheuristic
- tabu search
- flowshop
- combinatorial optimization
- vehicle routing problem
- multi objective
- single machine
- linear programming
- traveling salesman problem
- variable neighborhood search
- np hard
- combinatorial optimization problems
- lead time
- particle swarm optimization
- processing times
- precedence constraints
- genetic algorithm
- feasible solution
- parallel machines
- simulated annealing
- decision making
- routing problem
- multi objective optimization
- multiple objectives
- path relinking
- branch and bound
- optimization algorithm
- optimization problems
- search space
- heuristic methods
- robust optimization
- neural network
- optimal solution
- benchmark instances
- search algorithm
- job shop scheduling problem
- evolutionary algorithm
- knapsack problem