An evolutionary algorithm with path-relinking for the parallel machine with job splitting.
Paulo L. de Oliveira JuniorJosé Elias Claudio ArroyoAndré Gustavo dos SantosLuciana Brugiolo GonçalvesAlcione P. OliveiraPublished in: SMC (2012)
Keyphrases
- path relinking
- evolutionary algorithm
- parallel machines
- tabu search
- flowshop
- simulated annealing
- scheduling problem
- release dates
- scheduling jobs
- metaheuristic
- single machine scheduling problem
- optimization problems
- earliness tardiness
- search procedure
- parallel machine scheduling problem
- processing times
- scatter search
- combinatorial optimization
- multi objective
- sequence dependent setup times
- precedence constraints
- genetic algorithm
- traveling salesman problem
- single machine
- max min
- nsga ii
- differential evolution
- fitness function
- feasible solution
- setup times
- solution space
- multi objective optimization
- np hard
- genetic programming
- hybrid algorithm
- grasp with path relinking
- vehicle routing problem
- solution quality
- variable neighborhood search
- test problems
- ant colony optimization
- parallel computing
- benchmark problems
- distributed memory
- list scheduling
- completion times
- lot sizing
- search algorithm
- job shop scheduling problem
- hill climbing
- knapsack problem
- genetic algorithm ga
- branch and bound algorithm
- wireless sensor networks
- computational complexity