This article develops a novel two-stage algorithm for the detailed scheduling of branched multiproduct pipeline systems with a single refinery and multiple depots. It features continuous-time models allowing multiple batches to be injected/delivered over a slot. The first-stage model reduces the complexity by neglecting the lower flowrate limits, enforced by big-M constraints. The objective is to minimize the makespan. The second-stage model works with the first-stage assignments and with an extended time grid. Coupled with a backtracking mechanism, the proposed algorithm can significantly reduce computational time and improve the pipeline transportation capacity. We use four benchmark instances from the literature to test and validate the effectiveness and superiority of the method proposed in this paper. Compared to the literature, a new optimal solution is reported in one case, while the computational time is reduced by at least one order of magnitude in the other cases.

本文开发了一种新颖的两阶段算法，用于对具有单个炼油厂和多个仓库的分支多产品管道系统进行详细调度。它具有连续时间模型，允许通过一个插槽注入/交付多个批次。第一阶段模型通过忽略由大 M 约束强制执行的较低流速限制来降低复杂性。目标是最小化完工时间。第二阶段模型适用于第一阶段的任务和扩展的时间网格。结合回溯机制，该算法可以显着减少计算时间，提高管道运输能力。我们使用文献中的四个基准实例来测试和验证本文提出的方法的有效性和优越性。与文学作品相比，