Genetic algorithms for the scheduling problem with arbitrary precedence relations and skilled operators.
Raúl MencíaMaría R. SierraCarlos MencíaRamiro VarelaPublished in: Integr. Comput. Aided Eng. (2016)
Keyphrases
- precedence relations
- scheduling problem
- precedence constraints
- processing times
- genetic algorithm
- tabu search
- makespan minimization
- single machine
- flowshop
- setup times
- release dates
- np hard
- job shop scheduling problem
- single machine scheduling problem
- sequence dependent setup times
- parallel machines
- simulated annealing
- total weighted tardiness
- fitness function
- branch and bound algorithm
- artificial neural networks
- multi objective
- evolutionary algorithm
- resource constrained project scheduling problem
- neural network
- differential evolution
- memetic algorithm
- hybrid algorithm
- particle swarm optimization pso
- evolutionary computation
- job shop
- polynomially solvable
- particle swarm optimization
- approximation algorithms
- search algorithm
- feasible solution
- genetic algorithm ga
- optimization algorithm
- genetic programming