NNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems.
Tsung-Che ChiangHsueh-Chien ChengLi-Chen FuPublished in: Expert Syst. Appl. (2011)
Keyphrases
- scheduling problem
- memetic algorithm
- tabu search
- flowshop
- job shop
- multi objective
- timetabling problem
- job shop scheduling problem
- job shop scheduling
- single machine
- processing times
- strongly np hard
- sequence dependent setup times
- combinatorial optimization
- setup times
- metaheuristic
- np hard
- simulated annealing
- feasible solution
- vehicle routing problem
- minimizing makespan
- precedence constraints
- multi objective optimization
- particle swarm optimization
- parallel machines
- genetic algorithm
- squeaky wheel
- production scheduling
- evolutionary computation
- optimization algorithm
- evolutionary algorithm
- artificial neural networks
- crossover operator
- completion times
- maximum lateness
- search algorithm
- unrelated parallel machines
- reinforcement learning