Time-of-Use Scheduling Problem with Equal-Length Jobs.
Vincent ChauChenchen FuYan LyuWeiwei WuYizheng ZhangPublished in: TAMC (2022)
Keyphrases
- equal length
- scheduling problem
- flowshop
- processing times
- permutation flowshop
- single machine
- setup times
- parallel machines
- minimizing makespan
- total tardiness
- unrelated parallel machines
- precedence constraints
- earliness tardiness
- parallel machine scheduling problem
- np hard
- tabu search
- identical parallel machines
- sequence dependent setup times
- release dates
- scheduling jobs
- limited capacity
- total weighted tardiness
- maximum lateness
- identical machines
- strongly np hard
- sum of completion times
- minimize total
- completion times
- optimal scheduling
- job shop scheduling problem
- job shop
- upper bound
- lower bound
- simulated annealing
- job processing times
- list scheduling