An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption.
Damla YükselMehmet Fatih TasgetirenLevent KandillerLiang GaoPublished in: Comput. Ind. Eng. (2020)
Keyphrases
- minimize total
- bi objective
- single machine
- efficient solutions
- multi objective
- wireless sensor networks
- total cost
- parallel machines
- multi objective optimization
- ant colony optimization
- network design
- sensor networks
- scheduling problem
- multiple objectives
- release dates
- knapsack problem
- shortest path problem
- processing times
- nsga ii
- energy consumption
- cost sensitive
- single machine scheduling problem
- communication networks
- optimization algorithm
- genetic algorithm
- sequence dependent setup times
- misclassification costs
- routing problem
- flowshop
- dynamic programming
- evolutionary algorithm