Heuristics with grouping of jobs for power-aware scheduling problems.
Rafal RózyckiArkadiusz ZimniakPublished in: MMAR (2015)
Keyphrases
- scheduling problem
- list scheduling
- processing times
- dominance rules
- flowshop
- greedy heuristics
- single machine
- permutation flowshop
- earliness tardiness
- total tardiness
- setup times
- tardiness penalties
- parallel machines
- precedence constraints
- parallel machine scheduling problem
- sequence dependent setup times
- unrelated parallel machines
- identical parallel machines
- release dates
- minimizing makespan
- maximum lateness
- optimal scheduling
- total weighted tardiness
- identical machines
- np hard
- single machine scheduling problem
- power consumption
- weighted tardiness
- limited capacity
- job shop scheduling
- strongly np hard
- job shop scheduling problem
- sequencing problems
- preventive maintenance
- release times
- job scheduling
- scheduling decisions
- job shop
- tabu search
- special case
- shortest processing time
- randomly generated test problems
- genetic algorithm
- deteriorating jobs
- completion times
- search space
- computational complexity