A parallel memetic algorithm with explicit management of diversity for the job shop scheduling problem.
Oscar Hernández ConstantinoCarlos SeguraPublished in: Appl. Intell. (2022)
Keyphrases
- memetic algorithm
- job shop scheduling problem
- job shop scheduling
- tabu search
- critical path
- benchmark instances
- production scheduling
- evolutionary computation
- genetic algorithm
- combinatorial optimization
- job shop
- vehicle routing problem
- decision making
- benchmark problems
- simulated annealing
- neural network
- crossover operator
- scheduling problem
- information retrieval
- np complete
- optimal solution
- traveling salesman problem
- genetic programming
- metaheuristic
- document collections