Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic.
Rafal RózyckiJan WeglarzPublished in: Discret. Appl. Math. (2015)
Keyphrases
- scheduling problem
- flowshop
- processing times
- strongly np hard
- setup times
- permutation flowshop
- precedence constraints
- single machine
- parallel machines
- earliness tardiness
- total tardiness
- minimizing makespan
- parallel machine scheduling problem
- release dates
- maximum lateness
- limited capacity
- unrelated parallel machines
- np hard
- total weighted tardiness
- tabu search
- sequence dependent setup times
- special case
- single machine scheduling problem
- real time
- identical parallel machines
- completion times
- weighted tardiness
- data processing
- computational power
- scheduling jobs
- randomly generated test problems
- identical machines
- combinatorial optimization
- optimal scheduling
- job shop
- power consumption
- search algorithm for solving