Minimizing the Total Flowtime Flowshop with Blocking Using a Discrete Artificial Bee Colony.
Yu-Yan HanJun-Hua DuanYu-Jie YangMin ZhangBao YunPublished in: ICIC (2) (2011)
Keyphrases
- total flowtime
- artificial bee colony
- flowshop
- scheduling problem
- permutation flowshop
- minimizing makespan
- flowshop scheduling problems
- job shop scheduling problem
- optimization algorithm
- flowshop scheduling
- artificial bee colony algorithm
- swarm intelligence
- differential evolution
- genetic algorithm ga
- numerical optimization
- multi objective
- multiobjective optimization
- single machine
- special case
- processing times
- sequence dependent setup times
- tabu search
- greedy algorithm
- setup times
- upper bound
- ant colony optimization
- np hard
- parallel machines
- artificial immune system
- precedence constraints
- genetic algorithm
- particle swarm optimization pso
- particle swarm optimization
- strongly np hard
- benchmark problems
- motif discovery
- control parameters
- combinatorial optimization
- evolutionary algorithm
- artificial neural networks
- lower bound