A parallel heuristic for hybrid job shop scheduling problem considering conflict-free AGV routing.
Arash AmirteimooriErfan Babaee TirkolaeeVladimir SimicGerhard-Wilhelm WeberPublished in: Swarm Evol. Comput. (2023)
Keyphrases
- job shop scheduling problem
- conflict free
- job shop scheduling
- tabu search
- critical path
- simulated annealing
- benchmark instances
- benchmark problems
- scheduling problem
- functional dependencies
- genetic algorithm
- combinatorial optimization problems
- memetic algorithm
- tabu search algorithm
- combinatorial optimization
- graph model
- database schemes
- metaheuristic
- multivalued dependencies
- integrity constraints
- routing problem
- shortest path
- optimization problems
- data structure
- artificial intelligence