Implementation of Heterogeneous Makespan-minimizing DAG Scheduler

I need an experienced Python developer who can help me implement a task scheduling algorithm based on a research paper. Key Requirements: - The algorithm should be built based on the provided research paper. It's a Heterogeneous Makespan-minimizing DAG Scheduler. - The input for the algorithm will be a graph representation of tasks. - The algorithm should strictly consider dependencies as constraints. It must ensure dependencies are fully satisfied before scheduling. Ideal Skills & Experience: - Proficiency in Python - Strong understanding of task scheduling algorithms - Previous experience in implementing algorithms based on research papers - Familiarity with graph representation of tasks - Ability to handle and enforce task dependencies