The use of integer linear programs for solving complex real-time scheduling problems is investigated. The problem of scheduling a workload represented as a directed acyclic graph (DAG) upon a dedicated multiprocessor platform is considered, in which each individual vertex of the DAG is assigned to a specific processor and the entire DAG is required to complete execution within a specified duration. A representation of this scheduling problem as a zero-one integer linear program is obtained. Some guidelines are proposed for identifying scheduling problems amenable to solution by converting to integer linear programs.

中文翻译：

---

DAG 调度问题的 ILP 表示

研究了使用整数线性程序来解决复杂的实时调度问题。考虑在专用多处理器平台上调度表示为有向无环图（DAG）的工作负载的问题，其中DAG的每个单独顶点被分配给特定处理器，并且要求整个DAG在指定持续时间内完成执行。获得了该调度问题作为零一整数线性规划的表示。提出了一些指导方针，用于识别可通过转换为整数线性程序来解决的调度问题。