A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion.
Mehmet Fatih TasgetirenQuan-Ke PanPonnuthurai Nagaratnam SuganthanAngela Hsiang-Ling ChenPublished in: IEEE Congress on Evolutionary Computation (2010)
Keyphrases
- total flowtime
- artificial bee colony algorithm
- flowshop
- scheduling problem
- permutation flowshop
- minimizing makespan
- flowshop scheduling problems
- flowshop scheduling
- processing times
- special case
- particle swarm optimization algorithm
- setup times
- hybrid algorithm
- upper bound
- greedy algorithm
- artificial bee colony
- single machine
- parallel machines
- tabu search
- ant colony optimization
- job shop scheduling problem
- np hard
- search space
- strongly np hard
- particle swarm optimization
- dynamic programming
- redundancy allocation