A hybrid discrete firefly algorithm to solve flow shop scheduling problems to minimise total flow time.
M. K. MarichelvamM. GeethaPublished in: Int. J. Bio Inspired Comput. (2016)
Keyphrases
- scheduling problem
- flowshop
- firefly algorithm
- strongly np hard
- single machine
- processing times
- np hard
- tabu search
- completion times
- sequence dependent setup times
- flowshop scheduling
- job processing times
- job shop
- setup times
- total tardiness
- special case
- permutation flowshop
- makespan minimization
- minimizing makespan
- unrelated parallel machines
- parallel machines
- flowshop scheduling problems
- maximum lateness
- precedence constraints
- convergence speed
- job shop scheduling
- release dates
- genetic algorithm