A memetic algorithm for solving permutation flow shop problems with known and unknown machine breakdowns.
Humyun Fuad RahmanRuhul A. SarkerDaryl EssamGuijuan ChangPublished in: IEEE Congress on Evolutionary Computation (2014)
Keyphrases
- flowshop
- memetic algorithm
- tabu search
- scheduling problem
- combinatorial optimization
- timetabling problem
- flowshop scheduling problems
- job shop
- special case
- optimization problems
- test problems
- sequence dependent setup times
- strongly np hard
- neural network
- feasible solution
- job shop scheduling problem
- processing times
- maximum lateness
- flowshop scheduling
- minimizing makespan
- metaheuristic
- job shop scheduling
- search algorithm
- asymptotic optimality
- artificial intelligence