Near-Optimal Scheduling in the Congested Clique.
Keren Censor-HillelYannic MausVolodymyr PolosukhinPublished in: CoRR (2021)
Keyphrases
- scheduling problem
- scheduling algorithm
- resource constraints
- project scheduling
- dynamic scheduling
- database
- multiple objectives
- container terminal
- real time database systems
- round robin
- network resources
- case study
- single machine
- parallel machines
- shortest path
- graphical models
- parallel processors
- special case
- batch processing
- search algorithm
- data sets