Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling
IPDPS, pp. 738-747, 2017.
We propose a model for scheduling jobs in a parallel machine setting that takes into account the cost of migrations by assuming that the processing time of a job may depend on the specific set of machines among which the job is migrated. For the makespan minimization objective, the model generalizes classical scheduling problems such as u...More
Full Text (Upload PDF)
PPT (Upload PPT)