Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption.
S. Afshin MansouriEmel AktasUmut BesikciPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- flowshop
- energy consumption
- scheduling problem
- sequence dependent setup times
- unrelated parallel machines
- wireless sensor networks
- processing times
- minimizing total tardiness
- maximum lateness
- setup times
- energy efficient
- parallel machines
- energy efficiency
- energy saving
- single machine
- preventive maintenance
- minimizing makespan
- sensor networks
- energy conservation
- job shop
- bicriteria
- job processing times
- flowshop scheduling
- data transmission
- strongly np hard
- precedence constraints
- makespan minimization
- np hard
- tabu search
- permutation flowshop
- identical parallel machines
- maximum tardiness
- data center
- release dates
- lot streaming
- job shop scheduling problem
- routing protocol
- sensor nodes
- base station
- residual energy
- total energy
- flowshop scheduling problems
- special case
- scheduling jobs
- routing algorithm
- computational complexity
- completion times
- power consumption