Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time.
Kunal AgrawalJing LiKefu LuBenjamin MoseleyPublished in: SODA (2016)
Keyphrases
- identical machines
- parallel machines
- minimize total
- batch processing machines
- scheduling problem
- processing times
- single machine
- completion times
- job scheduling
- maximum lateness
- release dates
- identical parallel machines
- job processing times
- precedence constraints
- unrelated parallel machines
- scheduling jobs
- online learning
- shared memory
- setup times
- scheduling strategy
- flowshop
- weighted tardiness
- parallel processing
- batch processing
- computational grids
- polynomial time approximation
- optimal scheduling
- parallel computing
- directed acyclic graph
- flow field
- wafer fabrication
- release times
- tardiness cost
- real time
- load balancing
- fixed number
- parallel implementation
- multiprocessor systems
- flexible manufacturing systems
- scheduling policies
- parallel processors
- round robin
- distributed memory
- resource constraints