An improved gravitational search algorithm to the hybrid flowshop with unrelated parallel machines scheduling problem.
Cuiwen CaoYao ZhangXingsheng GuDan LiJie LiPublished in: Int. J. Prod. Res. (2021)
Keyphrases
- unrelated parallel machines
- scheduling problem
- flowshop
- setup times
- parallel machines
- single machine
- processing times
- minimizing makespan
- sequence dependent setup times
- np hard
- tabu search
- maximum lateness
- open shop
- job shop
- special case
- total tardiness
- precedence constraints
- job shop scheduling problem
- permutation flowshop
- completion times
- strongly np hard
- neural network
- search procedure
- optimization algorithm
- particle swarm optimization
- computational complexity