Scheduling Parallelizable Jobs Online to Minimize the Maximum Flow Time.
Kunal AgrawalJing LiKefu LuBenjamin MoseleyPublished in: SPAA (2016)
Keyphrases
- maximum flow
- minimize total
- completion times
- scheduling problem
- parallel machines
- single machine
- release dates
- job scheduling
- identical parallel machines
- minimum cut
- optimal scheduling
- release times
- identical machines
- job processing times
- scheduling strategy
- unrelated parallel machines
- precedence constraints
- processing times
- batch processing
- directed graph
- scheduling jobs
- precedence relations
- single machine scheduling problem
- wafer fabrication
- flowshop
- scheduling algorithm
- deteriorating jobs
- push relabel
- maximum lateness
- scheduling policies
- resource allocation
- graphical models