A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion.
Guanlong DengXingsheng GuPublished in: Comput. Oper. Res. (2012)
Keyphrases
- differential evolution algorithm
- differential evolution
- evolutionary algorithm
- flowshop
- control parameters
- processing times
- global numerical optimization
- mutation operation
- scheduling problem
- initial population
- scale factor
- single machine
- optimization model
- genetic algorithm
- optimization problems
- genetic programming
- traveling salesman problem
- optimization algorithm
- np hard
- multi objective
- particle swarm
- real time
- neural network
- optimal solution
- evolutionary computation