A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop.
Jingcao CaiDeming LeiMing LiPublished in: Int. J. Prod. Res. (2021)
Keyphrases
- scheduling problem
- flowshop
- bi objective
- shuffled frog leaping algorithm
- job shop
- unrelated parallel machines
- setup times
- multi objective
- sequence dependent setup times
- parallel machines
- single machine
- multiple objectives
- tabu search
- ant colony optimization
- efficient solutions
- maximum lateness
- np hard
- processing times
- manufacturing cell
- multi objective optimization
- job shop scheduling problem
- precedence constraints
- completion times
- particle swarm optimization
- release dates
- network design
- heuristic methods
- nsga ii
- computer networks
- flowshop scheduling problems