Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay

YouTube·IEEE FOCS: Foundations of Computer Science

Explore a 20-minute IEEE conference talk on scheduling precedence-constrained jobs on related machines with communication delay. Learn about duplication techniques, heterogeneous processing, and the challenges of delay constraints. Discover the makespan algorithm, integrality gap, and LP relaxation approaches. Gain insights into the main results, techniques, and open problems in this field of study presented by researchers from Northeastern University, Google, and Northwestern University.