An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems.
Bassem JarbouiMansour EddalyPatrick SiarryPublished in: Comput. Oper. Res. (2009)
Keyphrases
- flowshop scheduling problems
- estimation of distribution algorithms
- total flowtime
- flowshop scheduling
- permutation flowshop
- scheduling problem
- minimizing makespan
- feature subset selection
- flowshop
- particle swarm optimization algorithm
- evolutionary computation
- evolutionary algorithm
- particle swarm optimization
- upper bound
- genetic algorithm
- multi objective
- greedy algorithm
- combinatorial optimization
- multi objective optimization
- genetic programming
- combinatorial optimization problems
- np hard
- single machine
- setup times
- traveling salesman problem
- continuous domains
- objective function
- processing times
- tabu search
- simulated annealing
- fuzzy logic
- reinforcement learning
- feature selection