An imperialist competitive algorithm with feedback for energy-efficient flexible job shop scheduling with transportation and sequence-dependent setup times.
Ming LiDeming LeiPublished in: Eng. Appl. Artif. Intell. (2021)
Keyphrases
- job shop scheduling
- energy efficient
- scheduling problem
- sequence dependent setup times
- imperialist competitive algorithm
- single machine
- flowshop
- wireless sensor networks
- job shop scheduling problem
- parallel machines
- setup times
- precedence constraints
- energy consumption
- single machine scheduling problem
- sensor networks
- tabu search
- hybrid algorithm
- processing times
- global optimization
- base station
- np hard
- energy efficiency
- lot sizing
- routing protocol
- routing algorithm
- data transmission
- neural network
- special case
- branch and bound
- sensor nodes